./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/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 fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:59:41,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:59:41,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:59:41,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:59:41,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:59:41,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:59:41,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:59:41,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:59:41,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:59:41,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:59:41,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:59:41,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:59:41,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:59:41,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:59:41,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:59:41,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:59:41,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:59:41,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:59:41,228 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:59:41,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:59:41,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:59:41,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:59:41,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:59:41,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:59:41,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:59:41,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:59:41,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:59:41,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:59:41,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:59:41,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:59:41,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:59:41,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:59:41,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:59:41,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:59:41,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:59:41,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:59:41,238 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:59:41,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:59:41,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:59:41,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:59:41,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:59:41,250 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:59:41,251 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:59:41,251 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:59:41,251 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:59:41,251 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:59:41,251 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:59:41,251 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:59:41,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:59:41,252 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:59:41,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:59:41,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:59:41,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:59:41,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:59:41,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:59:41,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:59:41,253 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:59:41,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:59:41,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:59:41,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:59:41,253 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:59:41,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:59:41,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:59:41,254 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:59:41,254 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:59:41,255 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_6c122914-2d4d-4585-912c-9901ccec059d/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 -> fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 [2018-11-10 09:59:41,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:59:41,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:59:41,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:59:41,291 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:59:41,291 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:59:41,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-10 09:59:41,337 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/data/c871db29d/d83f57c85a164040a39b7e54b9f30ad0/FLAG1f13b084c [2018-11-10 09:59:41,771 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:59:41,772 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-10 09:59:41,780 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/data/c871db29d/d83f57c85a164040a39b7e54b9f30ad0/FLAG1f13b084c [2018-11-10 09:59:41,790 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/data/c871db29d/d83f57c85a164040a39b7e54b9f30ad0 [2018-11-10 09:59:41,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:59:41,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:59:41,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:59:41,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:59:41,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:59:41,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:59:41" (1/1) ... [2018-11-10 09:59:41,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62deb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:41, skipping insertion in model container [2018-11-10 09:59:41,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:59:41" (1/1) ... [2018-11-10 09:59:41,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:59:41,832 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:59:42,013 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:59:42,020 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:59:42,047 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:59:42,071 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:59:42,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42 WrapperNode [2018-11-10 09:59:42,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:59:42,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:59:42,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:59:42,073 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:59:42,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:59:42,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:59:42,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:59:42,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:59:42,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... [2018-11-10 09:59:42,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:59:42,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:59:42,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:59:42,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:59:42,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:59:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:59:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:59:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:59:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:59:42,352 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:59:42,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:42 BoogieIcfgContainer [2018-11-10 09:59:42,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:59:42,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:59:42,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:59:42,355 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:59:42,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:59:42,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:59:41" (1/3) ... [2018-11-10 09:59:42,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32b39c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:59:42, skipping insertion in model container [2018-11-10 09:59:42,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:59:42,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:42" (2/3) ... [2018-11-10 09:59:42,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32b39c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:59:42, skipping insertion in model container [2018-11-10 09:59:42,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:59:42,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:42" (3/3) ... [2018-11-10 09:59:42,359 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-10 09:59:42,398 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:59:42,399 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:59:42,399 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:59:42,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:59:42,399 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:59:42,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:59:42,399 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:59:42,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:59:42,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:59:42,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 09:59:42,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 09:59:42,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:59:42,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:59:42,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 09:59:42,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:42,435 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:59:42,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 09:59:42,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 09:59:42,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:59:42,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:59:42,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 09:59:42,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:42,442 INFO L793 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 18#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 21#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 15#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 19#L556-4true [2018-11-10 09:59:42,443 INFO L795 eck$LassoCheckResult]: Loop: 19#L556-4true assume true; 8#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 12#L555-1true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 16#L555-2true assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 6#L556true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 9#L556-1true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 13#L556-2true assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 4#L557true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 7#L557-1true SUMMARY for call write~int(test_fun_#t~mem9 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 10#L557-2true havoc test_fun_#t~mem9; 19#L556-4true [2018-11-10 09:59:42,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 09:59:42,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:42,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash 202362603, now seen corresponding path program 1 times [2018-11-10 09:59:42,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:42,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:42,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:42,569 INFO L82 PathProgramCache]: Analyzing trace with hash -281037813, now seen corresponding path program 1 times [2018-11-10 09:59:42,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:42,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:42,980 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 09:59:43,090 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:59:43,091 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:59:43,091 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:59:43,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:59:43,092 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:59:43,092 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:59:43,092 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:59:43,092 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:59:43,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-10 09:59:43,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:59:43,093 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:59:43,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,439 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 09:59:43,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:43,901 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:59:43,904 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:59:43,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:59:43,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:59:43,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:59:43,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:59:43,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:59:43,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:59:43,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:43,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:43,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:43,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:43,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,955 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:59:43,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,956 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:59:43,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:43,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,971 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:59:43,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,973 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:59:43,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:43,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:43,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:43,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:43,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:43,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:43,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:43,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:43,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:44,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:59:44,017 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:59:44,017 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:59:44,019 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:59:44,020 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:59:44,021 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:59:44,021 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 09:59:44,070 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 09:59:44,075 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:59:44,076 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:59:44,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:44,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:59:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:44,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:59:44,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:44,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 09:59:44,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-11-10 09:59:44,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:59:44,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:44,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:44,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:44,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 09:59:44,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:59:44,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:59:44,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:59:44,275 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 09:59:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:44,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 09:59:44,306 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 8 states. [2018-11-10 09:59:44,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 8 states. Result 67 states and 72 transitions. Complement of second has 14 states. [2018-11-10 09:59:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 09:59:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 09:59:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-10 09:59:44,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 09:59:44,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:59:44,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 09:59:44,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:59:44,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-10 09:59:44,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:59:44,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 72 transitions. [2018-11-10 09:59:44,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 09:59:44,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 39 states and 42 transitions. [2018-11-10 09:59:44,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 09:59:44,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 09:59:44,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2018-11-10 09:59:44,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:59:44,394 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-10 09:59:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2018-11-10 09:59:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-10 09:59:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 09:59:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-10 09:59:44,410 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-10 09:59:44,410 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-10 09:59:44,410 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:59:44,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2018-11-10 09:59:44,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 09:59:44,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:59:44,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:59:44,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:44,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:44,412 INFO L793 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 282#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 286#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 283#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 284#L556-4 assume true; 274#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 275#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 279#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 264#L556 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 265#L556-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 272#L556-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 278#L559 [2018-11-10 09:59:44,412 INFO L795 eck$LassoCheckResult]: Loop: 278#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 257#L559-1 SUMMARY for call write~int(test_fun_#t~mem10 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 258#L559-2 havoc test_fun_#t~mem10; 263#L556-4 assume true; 292#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 291#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 290#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 289#L556 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 288#L556-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 287#L556-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 278#L559 [2018-11-10 09:59:44,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:44,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1026480690, now seen corresponding path program 1 times [2018-11-10 09:59:44,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:44,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:44,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:44,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:44,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:44,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash 882861527, now seen corresponding path program 1 times [2018-11-10 09:59:44,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:44,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:44,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1874069816, now seen corresponding path program 1 times [2018-11-10 09:59:44,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:44,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:44,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:44,731 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 117 [2018-11-10 09:59:44,828 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:59:44,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:59:44,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:59:44,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:59:44,828 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:59:44,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:59:44,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:59:44,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:59:44,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 09:59:44,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:59:44,829 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:59:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:44,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:44,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:44,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:44,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:44,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,078 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-10 09:59:45,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:59:45,604 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:59:45,605 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:59:45,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:59:45,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:59:45,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:59:45,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:59:45,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:59:45,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:59:45,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:59:45,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:59:45,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:59:45,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,626 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:59:45,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,627 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:59:45,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:59:45,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:59:45,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:59:45,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:59:45,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:59:45,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:59:45,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:59:45,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:59:45,682 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:59:45,691 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:59:45,691 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:59:45,691 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:59:45,692 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:59:45,692 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:59:45,692 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-10 09:59:45,756 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 09:59:45,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:59:45,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:59:45,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:45,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:59:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:45,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:59:45,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:45,812 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 34 treesize of output 50 [2018-11-10 09:59:45,816 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 39 treesize of output 32 [2018-11-10 09:59:45,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:59:45,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:45,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-11-10 09:59:45,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 09:59:45,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:59:45,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:59:45,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-10 09:59:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:45,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-10 09:59:45,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 39 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-10 09:59:46,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 39 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 60 states and 65 transitions. Complement of second has 17 states. [2018-11-10 09:59:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 09:59:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:59:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2018-11-10 09:59:46,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 09:59:46,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:59:46,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-10 09:59:46,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:59:46,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-10 09:59:46,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:59:46,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 65 transitions. [2018-11-10 09:59:46,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 09:59:46,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 63 transitions. [2018-11-10 09:59:46,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 09:59:46,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 09:59:46,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 63 transitions. [2018-11-10 09:59:46,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:59:46,084 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-10 09:59:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 63 transitions. [2018-11-10 09:59:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-10 09:59:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 09:59:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-10 09:59:46,086 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 09:59:46,086 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 09:59:46,086 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:59:46,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2018-11-10 09:59:46,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 09:59:46,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:59:46,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:59:46,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:46,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:59:46,088 INFO L793 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 584#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 589#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 586#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 587#L556-4 assume true; 604#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 602#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 600#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 598#L556 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 596#L556-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 594#L556-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 592#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 591#L559-1 SUMMARY for call write~int(test_fun_#t~mem10 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 611#L559-2 havoc test_fun_#t~mem10; 610#L556-4 assume true; 609#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 608#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 607#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 566#L556 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 567#L556-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 572#L556-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 560#L557 [2018-11-10 09:59:46,088 INFO L795 eck$LassoCheckResult]: Loop: 560#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 561#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 570#L557-2 havoc test_fun_#t~mem9; 564#L556-4 assume true; 576#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 577#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 580#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 585#L556 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 606#L556-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 605#L556-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 560#L557 [2018-11-10 09:59:46,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1874069821, now seen corresponding path program 1 times [2018-11-10 09:59:46,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:46,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:46,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:46,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:59:46,302 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c122914-2d4d-4585-912c-9901ccec059d/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-10 09:59:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:46,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:59:46,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:46,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:59:46,510 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 44 treesize of output 45 [2018-11-10 09:59:46,523 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2018-11-10 09:59:46,526 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 09:59:46,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:59:46,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:59:46,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:22 [2018-11-10 09:59:46,596 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 26 treesize of output 22 [2018-11-10 09:59:46,598 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-10 09:59:46,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:59:46,603 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 11 treesize of output 7 [2018-11-10 09:59:46,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:59:46,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:59:46,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:59:46,607 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-10 09:59:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:46,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:59:46,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-10 09:59:46,628 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:59:46,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2106317609, now seen corresponding path program 2 times [2018-11-10 09:59:46,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:59:46,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:59:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:46,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:59:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:59:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:59:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 09:59:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-11-10 09:59:46,684 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 23 states. [2018-11-10 09:59:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:59:46,926 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-10 09:59:46,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 09:59:46,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2018-11-10 09:59:46,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:59:46,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2018-11-10 09:59:46,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:59:46,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:59:46,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:59:46,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:59:46,928 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:59:46,929 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:59:46,929 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:59:46,929 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:59:46,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:59:46,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:59:46,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:59:46,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:59:46 BoogieIcfgContainer [2018-11-10 09:59:46,934 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:59:46,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:59:46,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:59:46,934 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:59:46,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:42" (3/4) ... [2018-11-10 09:59:46,937 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:59:46,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:59:46,937 INFO L168 Benchmark]: Toolchain (without parser) took 5144.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 957.1 MB in the beginning and 949.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 335.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:46,938 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:59:46,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.02 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:46,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:46,939 INFO L168 Benchmark]: Boogie Preprocessor took 16.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:59:46,939 INFO L168 Benchmark]: RCFGBuilder took 192.22 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:46,940 INFO L168 Benchmark]: BuchiAutomizer took 4580.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 157.0 MB). Peak memory consumption was 348.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:46,940 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.4 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:59:46,942 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 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.02 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 192.22 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4580.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 157.0 MB). Peak memory consumption was 348.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.4 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. 1 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 74 SDslu, 78 SDs, 0 SdLazy, 298 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax106 hnf100 lsp89 ukn82 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...