./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/array01-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_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/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 9a031a295ba45c7116aee95a6abc238e63986cbf ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:03:13,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:03:13,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:03:13,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:03:13,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:03:13,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:03:13,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:03:13,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:03:13,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:03:13,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:03:13,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:03:13,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:03:13,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:03:13,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:03:13,600 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:03:13,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:03:13,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:03:13,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:03:13,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:03:13,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:03:13,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:03:13,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:03:13,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:03:13,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:03:13,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:03:13,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:03:13,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:03:13,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:03:13,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:03:13,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:03:13,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:03:13,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:03:13,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:03:13,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:03:13,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:03:13,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:03:13,614 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:03:13,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:03:13,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:03:13,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:03:13,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:03:13,625 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:03:13,625 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:03:13,626 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:03:13,626 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:03:13,626 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:03:13,626 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:03:13,626 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:03:13,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:03:13,626 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:03:13,627 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:03:13,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:03:13,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:03:13,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:03:13,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:03:13,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:03:13,628 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:03:13,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:03:13,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:03:13,628 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:03:13,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:03:13,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:03:13,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:03:13,629 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:03:13,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:03:13,629 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:03:13,629 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:03:13,630 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:03:13,630 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_c2809016-4b91-444c-a2bd-660c448782e0/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 -> 9a031a295ba45c7116aee95a6abc238e63986cbf [2018-11-10 07:03:13,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:03:13,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:03:13,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:03:13,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:03:13,665 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:03:13,666 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:03:13,706 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/data/91c57d05d/2a304f5886f1430cbcd5c3eeea1afc5e/FLAG3269d74a1 [2018-11-10 07:03:14,137 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:03:14,137 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/sv-benchmarks/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:03:14,144 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/data/91c57d05d/2a304f5886f1430cbcd5c3eeea1afc5e/FLAG3269d74a1 [2018-11-10 07:03:14,153 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/bin-2019/uautomizer/data/91c57d05d/2a304f5886f1430cbcd5c3eeea1afc5e [2018-11-10 07:03:14,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:03:14,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:03:14,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:03:14,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:03:14,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:03:14,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14, skipping insertion in model container [2018-11-10 07:03:14,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:03:14,195 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:03:14,359 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:03:14,367 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:03:14,396 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:03:14,428 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:03:14,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14 WrapperNode [2018-11-10 07:03:14,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:03:14,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:03:14,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:03:14,429 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:03:14,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:03:14,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:03:14,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:03:14,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:03:14,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... [2018-11-10 07:03:14,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:03:14,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:03:14,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:03:14,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:03:14,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2809016-4b91-444c-a2bd-660c448782e0/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 07:03:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:03:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:03:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:03:14,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:03:14,752 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:03:14,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:14 BoogieIcfgContainer [2018-11-10 07:03:14,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:03:14,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:03:14,753 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:03:14,757 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:03:14,758 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:14,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:03:14" (1/3) ... [2018-11-10 07:03:14,759 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49389ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:03:14, skipping insertion in model container [2018-11-10 07:03:14,759 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:14,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:14" (2/3) ... [2018-11-10 07:03:14,760 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49389ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:03:14, skipping insertion in model container [2018-11-10 07:03:14,760 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:03:14,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:14" (3/3) ... [2018-11-10 07:03:14,762 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:03:14,808 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:03:14,809 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:03:14,809 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:03:14,809 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:03:14,809 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:03:14,809 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:03:14,809 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:03:14,809 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:03:14,809 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:03:14,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 07:03:14,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:03:14,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:14,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:14,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:03:14,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:03:14,844 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:03:14,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 07:03:14,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:03:14,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:14,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:14,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:03:14,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 07:03:14,853 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L554true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 13#L554-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 17#L544-4true [2018-11-10 07:03:14,854 INFO L795 eck$LassoCheckResult]: Loop: 17#L544-4true assume true; 8#L544-1true assume !!(test_fun_~i~0 < test_fun_~N); 15#L545-4true assume !true; 16#L544-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 17#L544-4true [2018-11-10 07:03:14,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 07:03:14,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:14,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:14,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:14,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:14,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:14,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1329224, now seen corresponding path program 1 times [2018-11-10 07:03:14,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:14,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:14,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:14,970 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 07:03:14,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:03:14,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:03:14,973 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:03:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:03:14,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:03:14,984 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-10 07:03:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:03:14,988 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-10 07:03:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:03:14,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-10 07:03:14,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:03:14,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2018-11-10 07:03:14,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 07:03:14,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 07:03:14,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-10 07:03:14,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:03:14,994 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 07:03:15,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-10 07:03:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-10 07:03:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 07:03:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-10 07:03:15,012 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 07:03:15,012 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 07:03:15,012 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:03:15,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-10 07:03:15,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:03:15,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:15,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:15,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:03:15,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,014 INFO L793 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 52#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 53#L554-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 59#L544-4 [2018-11-10 07:03:15,014 INFO L795 eck$LassoCheckResult]: Loop: 59#L544-4 assume true; 54#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 55#L545-4 assume true; 49#L545-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L545-1 50#L545-2 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 56#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 59#L544-4 [2018-11-10 07:03:15,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 07:03:15,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:15,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1276985362, now seen corresponding path program 1 times [2018-11-10 07:03:15,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:03:15,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042314, now seen corresponding path program 1 times [2018-11-10 07:03:15,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:15,270 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:15,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:15,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:15,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:15,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:15,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:15,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:15,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:15,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 07:03:15,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:15,272 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:15,288 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 07:03:15,292 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 07:03:15,294 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 07:03:15,296 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 07:03:15,300 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 07:03:15,305 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 07:03:15,308 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 07:03:15,309 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 07:03:15,311 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 07:03:15,446 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 07:03:15,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:03:15,449 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 07:03:15,450 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 07:03:15,705 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:15,708 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:15,710 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 07:03:15,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:15,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:15,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:15,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,716 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 07:03:15,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:15,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:15,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:15,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,719 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 07:03:15,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:15,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:15,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:15,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,722 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 07:03:15,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:15,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:15,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,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 07:03:15,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:15,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:15,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:15,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,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 07:03:15,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:15,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:15,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,737 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 07:03:15,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:15,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:15,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:15,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,740 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 07:03:15,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:15,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:15,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:15,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:15,743 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 07:03:15,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:15,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:15,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:15,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:15,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:15,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:15,813 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:15,857 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 07:03:15,858 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 07:03:15,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:15,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:03:15,861 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:15,861 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-10 07:03:15,884 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 07:03:15,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:15,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:15,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:15,942 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 07:03:15,945 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 07:03:15,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 07:03:15,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 6 states. [2018-11-10 07:03:15,985 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 07:03:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:03:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 07:03:15,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 07:03:15,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:15,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 07:03:15,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:15,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 07:03:15,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:15,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-10 07:03:15,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:03:15,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 27 transitions. [2018-11-10 07:03:15,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 07:03:15,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 07:03:15,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 07:03:15,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:03:15,991 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:03:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 07:03:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 07:03:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 07:03:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 07:03:15,993 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:03:15,993 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:03:15,993 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:03:15,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 07:03:15,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:03:15,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:15,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:15,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:15,995 INFO L793 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 161#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 162#L554-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 170#L544-4 assume true; 163#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 164#L545-4 [2018-11-10 07:03:15,995 INFO L795 eck$LassoCheckResult]: Loop: 164#L545-4 assume true; 155#L545-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L545-1 156#L545-2 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 149#L546 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 150#L546-1 test_fun_#t~post5 := test_fun_#t~mem4; 153#L546-2 SUMMARY for call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-2 159#L546-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 164#L545-4 [2018-11-10 07:03:15,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 07:03:15,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:15,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:15,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-11-10 07:03:16,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:16,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-11-10 07:03:16,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,217 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:16,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:16,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:16,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:16,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:16,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:16,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:16,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:16,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 07:03:16,218 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:16,218 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:16,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 07:03:16,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 07:03:16,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 07:03:16,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 07:03:16,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 07:03:16,322 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 07:03:16,324 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 07:03:16,326 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 07:03:16,327 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 07:03:16,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 07:03:16,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 07:03:16,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 07:03:16,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 07:03:16,577 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:16,578 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:16,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,593 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 07:03:16,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,595 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 07:03:16,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,599 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 07:03:16,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,603 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 07:03:16,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,604 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:03:16,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,606 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:03:16,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,619 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 07:03:16,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,623 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 07:03:16,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:16,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:16,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:16,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:16,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:16,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:16,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:16,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:16,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:16,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:16,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:16,654 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:16,655 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:03:16,655 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:03:16,656 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:16,656 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:03:16,656 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:16,656 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-10 07:03:16,668 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 07:03:16,669 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:03:16,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:16,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:16,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:16,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:03:16,772 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 07:03:16,777 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 07:03:16,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:03:16,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:03:16,792 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 07:03:16,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 07:03:16,802 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 07:03:16,803 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 07:03:16,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 07:03:16,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 56 states and 63 transitions. Complement of second has 13 states. [2018-11-10 07:03:16,843 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 07:03:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 07:03:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 07:03:16,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 07:03:16,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:16,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 07:03:16,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:16,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 07:03:16,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:16,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-11-10 07:03:16,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:03:16,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 36 states and 41 transitions. [2018-11-10 07:03:16,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 07:03:16,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 07:03:16,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-11-10 07:03:16,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:03:16,847 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-10 07:03:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-11-10 07:03:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-10 07:03:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 07:03:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 07:03:16,849 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:03:16,849 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:03:16,849 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:03:16,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 07:03:16,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:03:16,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:03:16,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:03:16,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:16,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:03:16,851 INFO L793 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 329#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 330#L554-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 341#L544-4 assume true; 334#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 335#L545-4 assume true; 325#L545-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L545-1 326#L545-2 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 331#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := test_fun_#t~post2 + 1;havoc test_fun_#t~post2; 342#L544-4 assume true; 332#L544-1 assume !!(test_fun_~i~0 < test_fun_~N); 333#L545-4 [2018-11-10 07:03:16,851 INFO L795 eck$LassoCheckResult]: Loop: 333#L545-4 assume true; 323#L545-1 SUMMARY for call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L545-1 324#L545-2 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 317#L546 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546 318#L546-1 test_fun_#t~post5 := test_fun_#t~mem4; 321#L546-2 SUMMARY for call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + test_fun_~i~0 * 4, 4); srcloc: L546-2 327#L546-3 havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := test_fun_#t~post6 + 1;havoc test_fun_#t~post6; 333#L545-4 [2018-11-10 07:03:16,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 574587163, now seen corresponding path program 2 times [2018-11-10 07:03:16,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:03:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-11-10 07:03:16,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:16,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:03:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash -878623198, now seen corresponding path program 1 times [2018-11-10 07:03:16,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:03:16,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:03:16,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:03:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:03:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:03:17,066 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:03:17,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:03:17,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:03:17,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:03:17,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:03:17,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:03:17,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:03:17,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:03:17,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 07:03:17,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:03:17,067 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:03:17,069 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 07:03:17,073 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 07:03:17,074 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 07:03:17,076 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 07:03:17,078 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 07:03:17,079 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 07:03:17,080 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 07:03:17,081 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 07:03:17,180 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 07:03:17,181 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 07:03:17,183 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 07:03:17,184 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 07:03:17,186 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 07:03:17,388 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:03:17,389 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:03:17,389 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 07:03:17,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:17,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:17,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:17,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:17,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:17,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:17,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:17,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,393 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 07:03:17,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,396 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 07:03:17,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,401 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 07:03:17,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:17,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:17,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:17,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:17,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:17,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:17,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:17,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,405 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 07:03:17,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,407 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 07:03:17,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,419 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 07:03:17,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:17,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:17,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,428 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 07:03:17,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:17,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:03:17,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:03:17,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:03:17,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:03:17,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:03:17,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:03:17,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:03:17,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:03:17,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:03:17,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:03:17,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:03:17,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:03:17,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:03:17,439 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:03:17,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:03:17,440 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:03:17,440 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:03:17,440 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-10 07:03:17,461 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 07:03:17,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:03:17,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:03:17,531 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 07:03:17,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:03:17,535 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 07:03:17,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:03:17,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:03:17,566 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 07:03:17,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 07:03:17,580 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 07:03:17,581 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 07:03:17,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 07:03:17,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 46 states and 53 transitions. Complement of second has 13 states. [2018-11-10 07:03:17,653 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 07:03:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 07:03:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-10 07:03:17,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 07:03:17,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,654 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:03:17,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:03:17,755 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 07:03:17,761 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:03:17,762 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 07:03:17,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:03:17,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:03:17,774 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 07:03:17,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 07:03:17,790 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 07:03:17,791 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 07:03:17,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 07:03:17,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 45 states and 52 transitions. Complement of second has 15 states. [2018-11-10 07:03:17,844 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 07:03:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 07:03:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-11-10 07:03:17,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 07:03:17,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,844 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:03:17,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:03:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:03:17,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:03:17,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:03:17,907 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 07:03:17,910 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:03:17,911 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 07:03:17,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:03:17,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:03:17,928 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 07:03:17,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 07:03:17,936 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 07:03:17,937 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 07:03:17,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 07:03:17,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 60 states and 70 transitions. Complement of second has 12 states. [2018-11-10 07:03:17,976 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 07:03:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 07:03:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-11-10 07:03:17,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 07:03:17,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 19 letters. Loop has 7 letters. [2018-11-10 07:03:17,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 12 letters. Loop has 14 letters. [2018-11-10 07:03:17,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:03:17,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 70 transitions. [2018-11-10 07:03:17,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:03:17,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2018-11-10 07:03:17,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:03:17,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:03:17,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:03:17,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:03:17,981 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:17,981 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:17,981 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:03:17,981 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:03:17,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:03:17,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:03:17,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:03:17,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:03:17 BoogieIcfgContainer [2018-11-10 07:03:17,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:03:17,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:03:17,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:03:17,986 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:03:17,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:03:14" (3/4) ... [2018-11-10 07:03:17,989 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:03:17,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:03:17,990 INFO L168 Benchmark]: Toolchain (without parser) took 3834.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 957.5 MB in the beginning and 831.9 MB in the end (delta: 125.7 MB). Peak memory consumption was 331.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:17,991 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:03:17,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.03 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 929.6 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:17,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:17,992 INFO L168 Benchmark]: Boogie Preprocessor took 16.75 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 07:03:17,993 INFO L168 Benchmark]: RCFGBuilder took 235.59 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:17,993 INFO L168 Benchmark]: BuchiAutomizer took 3232.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 831.9 MB in the end (delta: 257.8 MB). Peak memory consumption was 342.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:03:17,994 INFO L168 Benchmark]: Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 831.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:03:17,996 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.03 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 929.6 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.75 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 235.59 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3232.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 831.9 MB in the end (delta: 257.8 MB). Peak memory consumption was 342.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.21 ms. Allocated memory is still 1.2 GB. Free memory is still 831.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 77 SDtfs, 75 SDslu, 31 SDs, 0 SdLazy, 121 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital147 mio100 ax100 hnf98 lsp91 ukn93 mio100 lsp51 div100 bol100 ite100 ukn100 eq181 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 5 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...