./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/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 713a0db238d04edd758f664dd8a5a1ba1d1680db ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:21:30,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:21:30,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:21:30,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:21:30,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:21:30,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:21:30,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:21:30,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:21:30,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:21:30,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:21:30,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:21:30,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:21:30,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:21:30,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:21:30,527 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:21:30,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:21:30,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:21:30,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:21:30,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:21:30,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:21:30,547 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:21:30,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:21:30,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:21:30,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:21:30,553 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:21:30,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:21:30,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:21:30,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:21:30,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:21:30,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:21:30,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:21:30,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:21:30,559 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:21:30,559 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:21:30,560 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:21:30,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:21:30,561 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 16:21:30,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:21:30,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:21:30,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:21:30,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:21:30,576 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:21:30,576 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:21:30,583 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:21:30,583 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:21:30,583 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:21:30,583 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:21:30,583 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:21:30,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:21:30,584 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:21:30,585 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:21:30,585 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:21:30,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:21:30,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:21:30,585 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:21:30,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:21:30,585 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:21:30,585 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:21:30,586 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:21:30,586 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_46cc65bc-9f05-4a82-b98a-4930f7c009a4/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 -> 713a0db238d04edd758f664dd8a5a1ba1d1680db [2018-11-18 16:21:30,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:21:30,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:21:30,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:21:30,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:21:30,635 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:21:30,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-18 16:21:30,678 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/data/db39e37a7/7151a09cdc454188be436c1a1efd3cc0/FLAGf57b0ce10 [2018-11-18 16:21:31,052 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:21:31,053 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-18 16:21:31,063 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/data/db39e37a7/7151a09cdc454188be436c1a1efd3cc0/FLAGf57b0ce10 [2018-11-18 16:21:31,446 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/data/db39e37a7/7151a09cdc454188be436c1a1efd3cc0 [2018-11-18 16:21:31,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:21:31,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:21:31,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:31,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:21:31,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:21:31,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248456ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31, skipping insertion in model container [2018-11-18 16:21:31,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:21:31,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:21:31,719 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:31,727 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:21:31,774 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:31,859 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:21:31,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31 WrapperNode [2018-11-18 16:21:31,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:31,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:31,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:21:31,860 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:21:31,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:31,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:21:31,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:21:31,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:21:31,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... [2018-11-18 16:21:31,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:21:31,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:21:31,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:21:31,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:21:31,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:21:31,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:21:31,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:21:31,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:21:31,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:21:31,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:21:32,222 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:21:32,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:32 BoogieIcfgContainer [2018-11-18 16:21:32,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:21:32,223 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:21:32,223 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:21:32,226 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:21:32,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:32,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:21:31" (1/3) ... [2018-11-18 16:21:32,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0771eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:21:32, skipping insertion in model container [2018-11-18 16:21:32,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:32,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:31" (2/3) ... [2018-11-18 16:21:32,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0771eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:21:32, skipping insertion in model container [2018-11-18 16:21:32,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:32,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:32" (3/3) ... [2018-11-18 16:21:32,230 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-18 16:21:32,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:21:32,279 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:21:32,279 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:21:32,279 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:21:32,279 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:21:32,280 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:21:32,280 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:21:32,280 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:21:32,280 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:21:32,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 16:21:32,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:32,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:32,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:32,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:21:32,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:32,322 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:21:32,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 16:21:32,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:32,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:32,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:32,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:21:32,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:32,331 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;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~mem8, test_fun_#t~mem14, 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; 8#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; 11#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 9#L558-4true [2018-11-18 16:21:32,331 INFO L796 eck$LassoCheckResult]: Loop: 9#L558-4true assume true; 4#L558-1true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 6#L558-2true 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~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 9#L558-4true [2018-11-18 16:21:32,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-11-18 16:21:32,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:32,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:32,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:32,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash 44918969, now seen corresponding path program 1 times [2018-11-18 16:21:32,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:32,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:32,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:32,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:32,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1300167121, now seen corresponding path program 1 times [2018-11-18 16:21:32,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:32,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:32,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:32,695 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 16:21:33,315 WARN L180 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-11-18 16:21:33,424 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:33,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:33,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:33,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:33,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:33,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:33,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:33,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:33,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 16:21:33,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:33,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:33,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,784 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-18 16:21:33,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:33,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:34,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:34,365 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:34,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:34,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:34,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:34,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:34,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:34,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,403 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:34,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,406 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:21:34,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:34,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,418 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:34,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:21:34,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:34,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,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-11-18 16:21:34,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:34,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:34,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:34,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:34,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:34,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:34,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:34,443 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:21:34,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:34,464 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 16:21:34,464 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 16:21:34,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:34,571 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 16:21:34,571 INFO L444 ModelExtractionUtils]: 36 out of 46 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 16:21:34,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:34,576 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-18 16:21:34,576 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:34,576 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)_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 [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 >= 0] [2018-11-18 16:21:34,721 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-11-18 16:21:34,728 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:21:34,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:34,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:34,832 INFO L477 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 70 treesize of output 46 [2018-11-18 16:21:34,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:34,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:34,893 INFO L477 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-11-18 16:21:34,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 16:21:34,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:34,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-18 16:21:34,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:34,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-18 16:21:35,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 16:21:35,014 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,022 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2018-11-18 16:21:35,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 16:21:35,035 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,041 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,089 INFO L477 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 29 treesize of output 54 [2018-11-18 16:21:35,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-18 16:21:35,097 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,117 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:35,161 INFO L477 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 26 treesize of output 51 [2018-11-18 16:21:35,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-18 16:21:35,165 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-18 16:21:35,205 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,222 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:21:35,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:21:35,262 INFO L477 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 62 treesize of output 38 [2018-11-18 16:21:35,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:35,265 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,285 INFO L477 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-11-18 16:21:35,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-18 16:21:35,289 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 16:21:35,321 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,381 INFO L477 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-11-18 16:21:35,401 INFO L477 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 33 treesize of output 36 [2018-11-18 16:21:35,401 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,475 INFO L477 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 25 [2018-11-18 16:21:35,488 INFO L477 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 19 treesize of output 27 [2018-11-18 16:21:35,489 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-11-18 16:21:35,503 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-18 16:21:35,560 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,614 INFO L477 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 33 [2018-11-18 16:21:35,615 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,654 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-18 16:21:35,733 INFO L477 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-11-18 16:21:35,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 16:21:35,737 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-18 16:21:35,756 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,769 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,855 INFO L477 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-11-18 16:21:35,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-18 16:21:35,861 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-18 16:21:35,916 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:35,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 16:21:35,956 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:35,994 INFO L477 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 33 [2018-11-18 16:21:35,995 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 3 xjuncts. [2018-11-18 16:21:36,026 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 16:21:36,074 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 16:21:36,102 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 16:21:36,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-18 16:21:36,165 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 3 variables, input treesize:133, output treesize:135 [2018-11-18 16:21:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:36,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:36,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:36,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 55 [2018-11-18 16:21:36,286 INFO L477 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 41 treesize of output 46 [2018-11-18 16:21:36,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:36,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:36,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-18 16:21:36,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:36,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:36,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:36,355 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:47, output treesize:76 [2018-11-18 16:21:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:36,398 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-11-18 16:21:36,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-11-18 16:21:36,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 51 states and 58 transitions. Complement of second has 11 states. [2018-11-18 16:21:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 16:21:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:21:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-18 16:21:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-18 16:21:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:36,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 16:21:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:36,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 16:21:36,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:36,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2018-11-18 16:21:36,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:36,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 23 states and 27 transitions. [2018-11-18 16:21:36,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 16:21:36,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 16:21:36,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-18 16:21:36,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:36,523 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-18 16:21:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-18 16:21:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-18 16:21:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 16:21:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-18 16:21:36,542 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-18 16:21:36,542 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-18 16:21:36,542 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:21:36,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-18 16:21:36,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:36,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:36,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:36,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:21:36,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:36,544 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;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~mem8, test_fun_#t~mem14, 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; 238#L555 assume test_fun_#t~short7; 239#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 240#L558-4 [2018-11-18 16:21:36,544 INFO L796 eck$LassoCheckResult]: Loop: 240#L558-4 assume true; 256#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 255#L558-2 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); 254#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; 246#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 240#L558-4 [2018-11-18 16:21:36,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 925611, now seen corresponding path program 1 times [2018-11-18 16:21:36,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:21:36,604 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:21:36,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash 44918969, now seen corresponding path program 2 times [2018-11-18 16:21:36,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:36,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:36,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:21:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:21:36,745 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 16:21:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:36,755 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 16:21:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:21:36,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-18 16:21:36,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:36,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 22 transitions. [2018-11-18 16:21:36,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 16:21:36,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 16:21:36,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-18 16:21:36,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:36,758 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:21:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-18 16:21:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 16:21:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:21:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-18 16:21:36,759 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:21:36,759 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:21:36,759 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:21:36,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-18 16:21:36,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:36,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:36,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:36,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:36,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:36,761 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;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~mem8, test_fun_#t~mem14, 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; 284#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; 285#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 286#L558-4 assume true; 288#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 289#L558-2 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); 297#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);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 292#L559-2 [2018-11-18 16:21:36,761 INFO L796 eck$LassoCheckResult]: Loop: 292#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 293#L558-4 assume true; 301#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 300#L558-2 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); 299#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; 292#L559-2 [2018-11-18 16:21:36,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash 180488208, now seen corresponding path program 1 times [2018-11-18 16:21:36,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:36,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:36,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash 57783779, now seen corresponding path program 3 times [2018-11-18 16:21:36,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:36,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:36,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:36,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 575495988, now seen corresponding path program 1 times [2018-11-18 16:21:36,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:36,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:36,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:36,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:37,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:21:37,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/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-11-18 16:21:37,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:37,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:37,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 16:21:37,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 16:21:37,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-18 16:21:37,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,297 INFO L477 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-11-18 16:21:37,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-18 16:21:37,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-18 16:21:37,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,350 INFO L477 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-11-18 16:21:37,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:37,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 16:21:37,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2018-11-18 16:21:37,374 INFO L477 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-11-18 16:21:37,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 16:21:37,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 16:21:37,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:37,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-18 16:21:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:37,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:21:37,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-11-18 16:21:37,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:21:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:21:37,463 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-18 16:21:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:37,529 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-18 16:21:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:21:37,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-18 16:21:37,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:37,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2018-11-18 16:21:37,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 16:21:37,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 16:21:37,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-18 16:21:37,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:37,530 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 16:21:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-18 16:21:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-11-18 16:21:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 16:21:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-18 16:21:37,531 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 16:21:37,531 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 16:21:37,531 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:21:37,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-18 16:21:37,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:37,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:37,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:37,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:37,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:37,532 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;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~mem8, test_fun_#t~mem14, 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; 376#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; 377#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 378#L558-4 assume true; 380#L558-1 [2018-11-18 16:21:37,532 INFO L796 eck$LassoCheckResult]: Loop: 380#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 381#L558-2 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); 388#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);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 384#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 385#L558-4 assume true; 380#L558-1 [2018-11-18 16:21:37,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash 28695880, now seen corresponding path program 1 times [2018-11-18 16:21:37,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:37,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:37,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:37,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 46919881, now seen corresponding path program 1 times [2018-11-18 16:21:37,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:37,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:37,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:37,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1650477026, now seen corresponding path program 1 times [2018-11-18 16:21:37,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:37,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:37,897 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2018-11-18 16:21:37,971 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:37,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:37,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:37,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:37,972 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:37,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:37,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:37,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:37,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-18 16:21:37,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:37,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:37,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:37,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:38,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:38,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:38,163 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2018-11-18 16:21:38,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:38,495 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:38,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:38,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:38,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:38,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:38,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:38,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:38,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:38,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:38,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:38,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:38,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:21:38,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:38,581 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 16:21:38,581 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 16:21:38,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:38,640 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 16:21:38,640 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:21:38,641 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:38,642 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-18 16:21:38,643 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:38,643 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 [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 >= 0] [2018-11-18 16:21:38,793 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-11-18 16:21:38,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:21:38,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:38,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:38,842 INFO L477 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 73 treesize of output 49 [2018-11-18 16:21:38,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:38,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:38,875 INFO L477 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-11-18 16:21:38,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-18 16:21:38,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:38,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-18 16:21:38,910 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:38,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:38,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:38,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-11-18 16:21:38,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 16:21:38,942 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:38,949 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:38,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:38,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:38,986 INFO L477 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 26 treesize of output 51 [2018-11-18 16:21:38,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-18 16:21:38,991 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 16:21:39,016 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,031 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:39,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:21:39,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:21:39,146 INFO L477 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-11-18 16:21:39,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:39,148 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,165 INFO L477 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-11-18 16:21:39,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-18 16:21:39,170 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-18 16:21:39,195 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,248 INFO L477 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-11-18 16:21:39,259 INFO L477 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 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 16:21:39,259 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-18 16:21:39,301 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,346 INFO L477 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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-18 16:21:39,346 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,376 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 16:21:39,425 INFO L477 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 22 treesize of output 34 [2018-11-18 16:21:39,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-18 16:21:39,428 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-18 16:21:39,445 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,453 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:39,502 INFO L477 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-11-18 16:21:39,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-18 16:21:39,507 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-18 16:21:39,553 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,583 INFO L477 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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-18 16:21:39,584 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-18 16:21:39,613 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,643 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 16:21:39,669 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 16:21:39,693 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 16:21:39,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:21:39,765 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:139, output treesize:49 [2018-11-18 16:21:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:39,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:39,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:39,882 INFO L477 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 40 treesize of output 39 [2018-11-18 16:21:39,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:39,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-11-18 16:21:39,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-11-18 16:21:39,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:39,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2018-11-18 16:21:39,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:39,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 16:21:39,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:39,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:33 [2018-11-18 16:21:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:39,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-11-18 16:21:39,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-18 16:21:40,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 31 states and 34 transitions. Complement of second has 11 states. [2018-11-18 16:21:40,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:21:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-11-18 16:21:40,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 11 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-18 16:21:40,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:40,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 16:21:40,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:40,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-18 16:21:40,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:40,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-11-18 16:21:40,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:40,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 18 states and 19 transitions. [2018-11-18 16:21:40,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 16:21:40,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 16:21:40,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-18 16:21:40,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:40,030 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 16:21:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-18 16:21:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-18 16:21:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 16:21:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 16:21:40,031 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 16:21:40,031 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 16:21:40,032 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:21:40,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-18 16:21:40,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:40,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:40,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:40,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:40,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:40,036 INFO L794 eck$LassoCheckResult]: Stem: 594#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;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~mem8, test_fun_#t~mem14, 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; 591#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; 592#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 593#L558-4 assume true; 597#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 598#L558-2 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); 604#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; 601#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 600#L558-4 [2018-11-18 16:21:40,036 INFO L796 eck$LassoCheckResult]: Loop: 600#L558-4 assume true; 595#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 596#L558-2 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); 603#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);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 599#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 600#L558-4 [2018-11-18 16:21:40,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1300167121, now seen corresponding path program 2 times [2018-11-18 16:21:40,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:40,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:40,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash 44919031, now seen corresponding path program 2 times [2018-11-18 16:21:40,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:40,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:40,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:40,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:40,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:40,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1114500825, now seen corresponding path program 2 times [2018-11-18 16:21:40,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:40,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:40,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:40,792 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2018-11-18 16:21:40,982 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-18 16:21:40,984 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:40,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:40,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:40,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:40,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:40,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:40,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:40,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:40,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-18 16:21:40,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:40,984 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:40,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:40,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:40,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,195 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-11-18 16:21:41,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:41,543 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:41,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:41,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:41,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:41,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:41,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:41,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:41,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:41,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:41,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:41,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:41,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:41,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:41,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:41,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:41,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:41,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:41,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:41,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:41,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:41,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:41,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:41,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:41,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:21:41,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:41,555 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 16:21:41,555 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 16:21:41,587 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:41,610 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:21:41,610 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:21:41,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:41,611 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-18 16:21:41,612 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:41,612 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 [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 >= 0] [2018-11-18 16:21:41,691 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-11-18 16:21:41,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:21:41,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:41,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:41,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:41,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 16:21:41,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:41,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:41,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 16:21:41,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-18 16:21:41,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-18 16:21:41,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 16:21:41,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:21:41,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2018-11-18 16:21:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:41,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:41,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:41,927 INFO L477 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 40 treesize of output 39 [2018-11-18 16:21:41,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:41,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-11-18 16:21:41,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:41,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-11-18 16:21:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:41,965 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2018-11-18 16:21:41,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-18 16:21:42,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 10 states. Result 37 states and 40 transitions. Complement of second has 13 states. [2018-11-18 16:21:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 16:21:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-11-18 16:21:42,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 16:21:42,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:42,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 15 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-18 16:21:42,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:42,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 15 transitions. Stem has 9 letters. Loop has 10 letters. [2018-11-18 16:21:42,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:42,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-11-18 16:21:42,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:42,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 23 states and 24 transitions. [2018-11-18 16:21:42,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 16:21:42,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 16:21:42,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-18 16:21:42,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:42,087 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-18 16:21:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-18 16:21:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-11-18 16:21:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:21:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-18 16:21:42,088 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 16:21:42,089 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 16:21:42,089 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:21:42,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-18 16:21:42,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 16:21:42,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:42,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:42,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 16:21:42,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:21:42,090 INFO L794 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 830#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet15, main_#t~nondet16;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~mem8, test_fun_#t~mem14, 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; 831#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; 832#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 833#L558-4 assume true; 845#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 848#L558-2 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); 846#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; 841#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 842#L558-4 assume true; 837#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 838#L558-2 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); 844#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; 847#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 840#L558-4 [2018-11-18 16:21:42,090 INFO L796 eck$LassoCheckResult]: Loop: 840#L558-4 assume true; 835#L558-1 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 836#L558-2 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); 843#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);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 839#L559-2 call test_fun_#t~mem13 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem13; 840#L558-4 [2018-11-18 16:21:42,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1114500887, now seen corresponding path program 3 times [2018-11-18 16:21:42,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:42,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:42,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:42,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:21:42,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cc65bc-9f05-4a82-b98a-4930f7c009a4/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-11-18 16:21:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:21:42,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 16:21:42,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:21:42,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:42,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:42,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 16:21:42,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:42,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:42,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 16:21:42,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,296 INFO L477 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-11-18 16:21:42,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:42,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-18 16:21:42,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:42,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-18 16:21:42,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:21:42,325 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,350 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 1 xjuncts. [2018-11-18 16:21:42,350 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:85, output treesize:26 [2018-11-18 16:21:42,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-18 16:21:42,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:21:42,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-18 16:21:42,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:42,406 INFO L477 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 36 treesize of output 51 [2018-11-18 16:21:42,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:42,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-18 16:21:42,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,419 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 1 xjuncts. [2018-11-18 16:21:42,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:34 [2018-11-18 16:21:42,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-11-18 16:21:42,457 INFO L477 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 19 treesize of output 12 [2018-11-18 16:21:42,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:42,463 INFO L477 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-11-18 16:21:42,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 16:21:42,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:42,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:42,478 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:17 [2018-11-18 16:21:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:42,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:21:42,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 16:21:42,524 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:21:42,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 44919031, now seen corresponding path program 3 times [2018-11-18 16:21:42,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:42,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:21:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:21:42,595 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-18 16:21:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:42,720 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2018-11-18 16:21:42,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:21:42,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 12 transitions. [2018-11-18 16:21:42,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:21:42,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2018-11-18 16:21:42,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:21:42,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:21:42,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:21:42,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:21:42,721 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:42,721 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:42,721 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:42,722 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:21:42,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:21:42,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:21:42,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:21:42,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:21:42 BoogieIcfgContainer [2018-11-18 16:21:42,727 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:21:42,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:21:42,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:21:42,727 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:21:42,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:32" (3/4) ... [2018-11-18 16:21:42,731 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:21:42,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:21:42,732 INFO L168 Benchmark]: Toolchain (without parser) took 11280.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.9 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 228.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:42,733 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:42,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:42,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:42,733 INFO L168 Benchmark]: Boogie Preprocessor took 20.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:42,734 INFO L168 Benchmark]: RCFGBuilder took 311.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:42,734 INFO L168 Benchmark]: BuchiAutomizer took 10504.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 242.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:42,734 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:42,736 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.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10504.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 242.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 45 SDtfs, 59 SDslu, 85 SDs, 0 SdLazy, 169 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital545 mio100 ax104 hnf100 lsp93 ukn46 mio100 lsp37 div100 bol100 ite100 ukn100 eq189 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 133ms 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...