./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/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 32bit --witnessprinter.graph.data.programhash f25230c4e3ada1aa4514132cfb87afb0e539c23b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:18:40,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:18:40,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:18:40,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:18:40,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:18:40,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:18:40,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:18:40,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:18:40,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:18:40,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:18:40,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:18:40,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:18:40,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:18:40,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:18:40,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:18:40,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:18:40,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:18:40,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:18:40,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:18:40,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:18:40,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:18:40,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:18:40,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:18:40,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:18:40,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:18:40,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:18:40,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:18:40,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:18:40,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:18:40,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:18:40,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:18:40,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:18:40,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:18:40,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:18:40,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:18:40,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:18:40,798 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:18:40,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:18:40,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:18:40,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:18:40,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:18:40,809 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:18:40,809 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:18:40,809 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:18:40,809 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:18:40,810 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:18:40,810 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:18:40,811 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:18:40,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:18:40,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:18:40,811 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:18:40,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:18:40,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:18:40,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:18:40,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:18:40,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:18:40,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:18:40,812 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:18:40,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:18:40,813 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:18:40,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:18:40,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:18:40,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:18:40,813 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:18:40,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:18:40,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:18:40,814 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:18:40,814 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:18:40,815 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_9fdd7511-1408-4748-ab48-076ef53b760d/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25230c4e3ada1aa4514132cfb87afb0e539c23b [2018-11-10 05:18:40,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:18:40,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:18:40,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:18:40,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:18:40,851 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:18:40,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:18:40,896 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/data/9204b9f18/e51a57339f654ee281dc14659ee287c9/FLAG0e07c638e [2018-11-10 05:18:41,332 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:18:41,332 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:18:41,342 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/data/9204b9f18/e51a57339f654ee281dc14659ee287c9/FLAG0e07c638e [2018-11-10 05:18:41,350 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/data/9204b9f18/e51a57339f654ee281dc14659ee287c9 [2018-11-10 05:18:41,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:18:41,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:18:41,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:18:41,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:18:41,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:18:41,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ceffb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41, skipping insertion in model container [2018-11-10 05:18:41,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:18:41,391 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:18:41,565 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:18:41,573 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:18:41,599 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:18:41,629 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:18:41,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41 WrapperNode [2018-11-10 05:18:41,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:18:41,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:18:41,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:18:41,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:18:41,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:18:41,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:18:41,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:18:41,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:18:41,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... [2018-11-10 05:18:41,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:18:41,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:18:41,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:18:41,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:18:41,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:18:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:18:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:18:41,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:18:41,897 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:18:41,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:18:41 BoogieIcfgContainer [2018-11-10 05:18:41,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:18:41,898 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:18:41,898 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:18:41,901 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:18:41,903 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:18:41,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:18:41" (1/3) ... [2018-11-10 05:18:41,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42d06ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:18:41, skipping insertion in model container [2018-11-10 05:18:41,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:18:41,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:41" (2/3) ... [2018-11-10 05:18:41,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42d06ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:18:41, skipping insertion in model container [2018-11-10 05:18:41,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:18:41,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:18:41" (3/3) ... [2018-11-10 05:18:41,906 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:18:41,945 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:18:41,946 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:18:41,946 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:18:41,946 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:18:41,946 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:18:41,946 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:18:41,946 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:18:41,946 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:18:41,947 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:18:41,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 05:18:41,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 05:18:41,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:41,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:41,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:18:41,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:18:41,976 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:18:41,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 05:18:41,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 05:18:41,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:41,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:41,978 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:18:41,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:18:41,984 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L544true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 24#L544-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3#L546true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 20#L547-3true [2018-11-10 05:18:41,985 INFO L795 eck$LassoCheckResult]: Loop: 20#L547-3true assume true; 17#L547-1true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 27#L549true assume main_~val~0 < 0;main_~val~0 := 0; 16#L549-2true SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L549-2 9#L552true main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 20#L547-3true [2018-11-10 05:18:41,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-10 05:18:41,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:41,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash 45963670, now seen corresponding path program 1 times [2018-11-10 05:18:42,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:42,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1986381362, now seen corresponding path program 1 times [2018-11-10 05:18:42,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:42,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,306 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:42,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:42,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:42,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:42,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:42,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:42,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:42,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:42,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 05:18:42,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:42,308 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:42,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:42,715 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:42,719 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:42,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:42,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:42,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:42,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:42,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:42,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:42,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:42,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:42,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:42,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:42,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:42,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:42,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:42,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:42,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:42,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:42,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:42,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:42,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:42,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:42,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:42,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:42,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:42,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:18:42,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,756 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:18:42,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:42,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:42,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:42,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:42,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:42,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:42,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:42,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:42,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:42,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:42,846 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:18:42,846 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 05:18:42,849 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:42,850 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:18:42,850 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:42,851 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-10 05:18:42,886 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:18:42,892 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:18:42,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:42,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:42,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:42,958 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 05:18:42,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 4 states. [2018-11-10 05:18:43,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 4 states. Result 63 states and 78 transitions. Complement of second has 7 states. [2018-11-10 05:18:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:18:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:18:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-10 05:18:43,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-10 05:18:43,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-10 05:18:43,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 05:18:43,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 78 transitions. [2018-11-10 05:18:43,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:18:43,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 28 transitions. [2018-11-10 05:18:43,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 05:18:43,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 05:18:43,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-10 05:18:43,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:43,010 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-10 05:18:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-10 05:18:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 05:18:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:18:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-10 05:18:43,027 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-10 05:18:43,027 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-10 05:18:43,027 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:18:43,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-10 05:18:43,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:18:43,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:43,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:43,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,029 INFO L793 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 168#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 169#L544-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 163#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 164#L547-3 assume true; 159#L547-1 assume !(main_~i~0 < main_~length~0); 160#L547-4 main_~j~0 := 0; 174#L554-4 [2018-11-10 05:18:43,029 INFO L795 eck$LassoCheckResult]: Loop: 174#L554-4 assume true; 177#L554-1 assume !!(main_~j~0 < main_~length~0); 178#L555-4 assume true; 171#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 172#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 176#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 174#L554-4 [2018-11-10 05:18:43,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 176703704, now seen corresponding path program 1 times [2018-11-10 05:18:43,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:43,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:43,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:18:43,070 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:43,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738674, now seen corresponding path program 1 times [2018-11-10 05:18:43,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:18:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:18:43,108 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 05:18:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:43,128 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 05:18:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:18:43,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 05:18:43,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:18:43,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 32 transitions. [2018-11-10 05:18:43,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 05:18:43,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 05:18:43,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-10 05:18:43,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:43,132 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 05:18:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-10 05:18:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-10 05:18:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:18:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 05:18:43,134 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:18:43,136 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:18:43,136 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:18:43,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 05:18:43,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:18:43,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:43,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:43,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,137 INFO L793 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 227#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 228#L544-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 221#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 222#L547-3 assume true; 219#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 220#L549 assume !(main_~val~0 < 0); 215#L549-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L549-2 216#L552 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 226#L547-3 assume true; 217#L547-1 assume !(main_~i~0 < main_~length~0); 218#L547-4 main_~j~0 := 0; 232#L554-4 [2018-11-10 05:18:43,137 INFO L795 eck$LassoCheckResult]: Loop: 232#L554-4 assume true; 234#L554-1 assume !!(main_~j~0 < main_~length~0); 235#L555-4 assume true; 229#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 230#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 236#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 232#L554-4 [2018-11-10 05:18:43,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash -170474767, now seen corresponding path program 1 times [2018-11-10 05:18:43,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738674, now seen corresponding path program 2 times [2018-11-10 05:18:43,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1238241570, now seen corresponding path program 1 times [2018-11-10 05:18:43,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,333 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2018-11-10 05:18:43,362 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:43,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:43,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:43,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:43,363 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:43,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:43,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:43,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:43,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 05:18:43,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:43,363 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:43,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:43,670 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:43,670 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:43,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:43,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:43,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:43,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:43,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:18:43,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,689 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:18:43,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:43,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:43,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:43,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:43,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:43,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:43,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:43,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:18:43,731 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:18:43,731 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:43,732 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:18:43,732 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:43,732 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2018-11-10 05:18:43,749 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:18:43,751 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:18:43,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:43,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:43,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:43,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 05:18:43,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-10 05:18:43,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 6 states. [2018-11-10 05:18:43,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:18:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:18:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 05:18:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-10 05:18:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-10 05:18:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-10 05:18:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-10 05:18:43,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:18:43,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-11-10 05:18:43,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 05:18:43,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:18:43,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-10 05:18:43,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:43,852 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 05:18:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-10 05:18:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-10 05:18:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 05:18:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-10 05:18:43,854 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-10 05:18:43,854 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-10 05:18:43,854 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:18:43,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2018-11-10 05:18:43,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:18:43,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:43,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:43,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,856 INFO L793 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 381#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 382#L544-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 369#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 370#L547-3 assume true; 373#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 374#L549 assume !(main_~val~0 < 0); 367#L549-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L549-2 368#L552 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 383#L547-3 assume true; 371#L547-1 assume !(main_~i~0 < main_~length~0); 372#L547-4 main_~j~0 := 0; 390#L554-4 assume true; 392#L554-1 assume !!(main_~j~0 < main_~length~0); 393#L555-4 [2018-11-10 05:18:43,856 INFO L795 eck$LassoCheckResult]: Loop: 393#L555-4 assume true; 384#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 385#L555-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7; 375#L556 SUMMARY for call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L556 376#L556-1 main_#t~post9 := main_#t~mem8; 379#L556-2 SUMMARY for call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L556-2 388#L556-3 havoc main_#t~mem8;havoc main_#t~post9; 393#L555-4 [2018-11-10 05:18:43,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash -617492554, now seen corresponding path program 1 times [2018-11-10 05:18:43,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 1 times [2018-11-10 05:18:43,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1017797342, now seen corresponding path program 1 times [2018-11-10 05:18:43,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,071 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2018-11-10 05:18:44,121 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:44,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:44,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:44,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:44,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:44,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:44,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:44,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:44,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 05:18:44,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:44,122 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:44,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 05:18:44,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:44,383 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:44,383 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:44,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:44,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:44,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:44,394 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:44,398 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:18:44,398 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:18:44,398 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:44,399 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:18:44,399 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:44,399 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_2 Supporting invariants [] [2018-11-10 05:18:44,415 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 05:18:44,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:18:44,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:18:44,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 05:18:44,531 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 54 treesize of output 29 [2018-11-10 05:18:44,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:18:44,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:44,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:44,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:18:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:44,549 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 05:18:44,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-10 05:18:44,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 65 states and 74 transitions. Complement of second has 13 states. [2018-11-10 05:18:44,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:18:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:18:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-10 05:18:44,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-10 05:18:44,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 22 letters. Loop has 7 letters. [2018-11-10 05:18:44,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-10 05:18:44,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2018-11-10 05:18:44,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:18:44,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 45 states and 52 transitions. [2018-11-10 05:18:44,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 05:18:44,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 05:18:44,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2018-11-10 05:18:44,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:44,598 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-10 05:18:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2018-11-10 05:18:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-10 05:18:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 05:18:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-10 05:18:44,601 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 05:18:44,601 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 05:18:44,601 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:18:44,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-11-10 05:18:44,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:18:44,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:44,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:44,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,605 INFO L793 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 608#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 598#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 599#L544-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 586#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 587#L547-3 assume true; 590#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 591#L549 assume !(main_~val~0 < 0); 584#L549-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L549-2 585#L552 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 600#L547-3 assume true; 588#L547-1 assume !(main_~i~0 < main_~length~0); 589#L547-4 main_~j~0 := 0; 607#L554-4 assume true; 611#L554-1 assume !!(main_~j~0 < main_~length~0); 612#L555-4 assume true; 605#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 606#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 617#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 618#L554-4 assume true; 609#L554-1 assume !!(main_~j~0 < main_~length~0); 610#L555-4 [2018-11-10 05:18:44,605 INFO L795 eck$LassoCheckResult]: Loop: 610#L555-4 assume true; 603#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 604#L555-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7; 592#L556 SUMMARY for call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L556 593#L556-1 main_#t~post9 := main_#t~mem8; 596#L556-2 SUMMARY for call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L556-2 601#L556-3 havoc main_#t~mem8;havoc main_#t~post9; 610#L555-4 [2018-11-10 05:18:44,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash 244209063, now seen corresponding path program 2 times [2018-11-10 05:18:44,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:44,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:44,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:18:44,679 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9fdd7511-1408-4748-ab48-076ef53b760d/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 05:18:44,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:18:44,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:18:44,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:18:44,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:44,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:18:44,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-10 05:18:44,769 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:44,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 2 times [2018-11-10 05:18:44,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:44,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:18:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:18:44,797 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 14 states. [2018-11-10 05:18:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:44,964 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-10 05:18:44,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:18:44,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-11-10 05:18:44,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:18:44,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 53 states and 61 transitions. [2018-11-10 05:18:44,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 05:18:44,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 05:18:44,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 61 transitions. [2018-11-10 05:18:44,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:44,967 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-10 05:18:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 61 transitions. [2018-11-10 05:18:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-10 05:18:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 05:18:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-10 05:18:44,970 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-10 05:18:44,970 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-10 05:18:44,970 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:18:44,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2018-11-10 05:18:44,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:18:44,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:44,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:44,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,972 INFO L793 eck$LassoCheckResult]: Stem: 840#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 821#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 822#L544-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 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];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 809#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 810#L547-3 assume true; 823#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L549 assume !(main_~val~0 < 0); 851#L549-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L549-2 850#L552 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 824#L547-3 assume true; 813#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 814#L549 assume !(main_~val~0 < 0); 807#L549-2 SUMMARY for call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L549-2 808#L552 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 841#L547-3 assume true; 811#L547-1 assume !(main_~i~0 < main_~length~0); 812#L547-4 main_~j~0 := 0; 831#L554-4 assume true; 835#L554-1 assume !!(main_~j~0 < main_~length~0); 836#L555-4 assume true; 843#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 847#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 844#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := main_#t~post6 + 1;havoc main_#t~post6; 845#L554-4 assume true; 833#L554-1 assume !!(main_~j~0 < main_~length~0); 834#L555-4 [2018-11-10 05:18:44,972 INFO L795 eck$LassoCheckResult]: Loop: 834#L555-4 assume true; 825#L555-1 SUMMARY for call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L555-1 826#L555-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7; 815#L556 SUMMARY for call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L556 816#L556-1 main_#t~post9 := main_#t~mem8; 819#L556-2 SUMMARY for call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L556-2 829#L556-3 havoc main_#t~mem8;havoc main_#t~post9; 834#L555-4 [2018-11-10 05:18:44,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 851364910, now seen corresponding path program 3 times [2018-11-10 05:18:44,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash -500589961, now seen corresponding path program 3 times [2018-11-10 05:18:44,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1879191978, now seen corresponding path program 1 times [2018-11-10 05:18:44,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,185 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2018-11-10 05:18:45,229 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:45,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:45,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:45,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:45,229 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:45,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:45,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:45,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:45,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 05:18:45,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:45,229 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:45,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:18:45,506 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:45,506 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:45,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:18:45,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:18:45,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:18:45,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,541 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:45,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:18:45,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:18:45,542 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:45,542 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:45,542 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:45,542 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_1 Supporting invariants [] [2018-11-10 05:18:45,567 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 05:18:45,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:18:45,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:18:45,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 05:18:45,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:18:45,635 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 05:18:45,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:18:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:45,654 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 05:18:45,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-10 05:18:45,693 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 60 states and 69 transitions. Complement of second has 13 states. [2018-11-10 05:18:45,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:18:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:18:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 05:18:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 26 letters. Loop has 7 letters. [2018-11-10 05:18:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,694 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:18:45,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:18:45,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 05:18:45,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:18:45,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 05:18:45,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:18:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:45,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:18:45,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-10 05:18:45,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 59 states and 68 transitions. Complement of second has 15 states. [2018-11-10 05:18:45,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 05:18:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:18:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-10 05:18:45,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 26 letters. Loop has 7 letters. [2018-11-10 05:18:45,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,815 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:18:45,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:18:45,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 05:18:45,868 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:18:45,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 05:18:45,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:18:45,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 05:18:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:18:45,899 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:18:45,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-10 05:18:45,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 74 states and 86 transitions. Complement of second has 12 states. [2018-11-10 05:18:45,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:18:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:18:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-10 05:18:45,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 26 letters. Loop has 7 letters. [2018-11-10 05:18:45,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 33 letters. Loop has 7 letters. [2018-11-10 05:18:45,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 26 letters. Loop has 14 letters. [2018-11-10 05:18:45,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2018-11-10 05:18:45,951 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:18:45,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2018-11-10 05:18:45,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:18:45,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:18:45,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:18:45,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:18:45,952 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:18:45,952 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:18:45,952 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:18:45,952 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:18:45,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:18:45,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:18:45,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:18:45,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:18:45 BoogieIcfgContainer [2018-11-10 05:18:45,958 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:18:45,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:18:45,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:18:45,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:18:45,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:18:41" (3/4) ... [2018-11-10 05:18:45,963 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:18:45,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:18:45,964 INFO L168 Benchmark]: Toolchain (without parser) took 4612.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -215.4 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:45,965 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:18:45,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.63 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:45,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:45,967 INFO L168 Benchmark]: Boogie Preprocessor took 17.09 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 05:18:45,967 INFO L168 Benchmark]: RCFGBuilder took 183.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:45,967 INFO L168 Benchmark]: BuchiAutomizer took 4059.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.6 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:45,968 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:18:45,972 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.63 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 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 67.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.09 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 183.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4059.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.6 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.94 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.9s. 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 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 159 SDtfs, 331 SDslu, 204 SDs, 0 SdLazy, 286 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf98 lsp93 ukn93 mio100 lsp49 div100 bol100 ite100 ukn100 eq167 hnf88 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...