./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/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 5375af47d6130a7bd98a5147355b5bb76e636a73 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:02:38,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:02:38,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:02:38,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:02:38,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:02:38,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:02:38,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:02:38,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:02:38,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:02:38,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:02:38,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:02:38,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:02:38,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:02:38,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:02:38,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:02:38,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:02:38,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:02:38,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:02:38,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:02:38,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:02:38,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:02:38,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:02:38,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:02:38,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:02:38,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:02:38,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:02:38,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:02:38,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:02:38,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:02:38,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:02:38,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:02:38,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:02:38,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:02:38,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:02:38,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:02:38,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:02:38,039 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 10:02:38,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:02:38,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:02:38,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:02:38,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:02:38,049 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:02:38,049 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 10:02:38,049 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 10:02:38,049 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 10:02:38,049 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 10:02:38,049 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 10:02:38,049 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 10:02:38,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:02:38,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:02:38,050 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:02:38,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:02:38,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:02:38,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 10:02:38,051 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:02:38,052 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 10:02:38,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:02:38,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:02:38,052 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 10:02:38,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:02:38,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:02:38,053 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 10:02:38,053 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 10:02:38,053 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_366b16fa-36d0-46d9-9413-4eebaec7ec46/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 -> 5375af47d6130a7bd98a5147355b5bb76e636a73 [2018-12-08 10:02:38,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:02:38,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:02:38,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:02:38,079 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:02:38,079 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:02:38,080 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i [2018-12-08 10:02:38,114 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/data/db3705e9d/19c3a9968dd74524b7cbf7b6cc94f3fa/FLAG8889550c6 [2018-12-08 10:02:38,494 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:02:38,495 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/sv-benchmarks/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i [2018-12-08 10:02:38,498 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/data/db3705e9d/19c3a9968dd74524b7cbf7b6cc94f3fa/FLAG8889550c6 [2018-12-08 10:02:38,507 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/data/db3705e9d/19c3a9968dd74524b7cbf7b6cc94f3fa [2018-12-08 10:02:38,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:02:38,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:02:38,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:02:38,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:02:38,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:02:38,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec9f2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38, skipping insertion in model container [2018-12-08 10:02:38,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:02:38,528 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:02:38,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:02:38,618 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:02:38,630 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:02:38,641 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:02:38,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38 WrapperNode [2018-12-08 10:02:38,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:02:38,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:02:38,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:02:38,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:02:38,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:02:38,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:02:38,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:02:38,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:02:38,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... [2018-12-08 10:02:38,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:02:38,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:02:38,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:02:38,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:02:38,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:02:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:02:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:02:38,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:02:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:02:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:02:38,848 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:02:38,848 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 10:02:38,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:02:38 BoogieIcfgContainer [2018-12-08 10:02:38,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:02:38,849 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 10:02:38,849 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 10:02:38,851 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 10:02:38,852 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:02:38,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:02:38" (1/3) ... [2018-12-08 10:02:38,853 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17f5cb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:02:38, skipping insertion in model container [2018-12-08 10:02:38,853 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:02:38,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:02:38" (2/3) ... [2018-12-08 10:02:38,853 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17f5cb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:02:38, skipping insertion in model container [2018-12-08 10:02:38,853 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:02:38,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:02:38" (3/3) ... [2018-12-08 10:02:38,854 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_single_elem_init_false-unreach-call_true-termination.i [2018-12-08 10:02:38,884 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:02:38,885 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 10:02:38,885 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 10:02:38,885 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 10:02:38,885 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:02:38,885 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:02:38,885 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 10:02:38,885 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:02:38,885 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 10:02:38,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-08 10:02:38,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-08 10:02:38,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:02:38,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:02:38,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:02:38,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 10:02:38,909 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 10:02:38,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-08 10:02:38,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-08 10:02:38,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:02:38,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:02:38,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:02:38,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 10:02:38,915 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 5#L10-3true [2018-12-08 10:02:38,916 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-3true assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 21#L14true assume 0 == main_~q~0;call write~int(1, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int((if main_~i~0 < 0 && 0 != main_~i~0 % 2 then main_~i~0 % 2 - 2 else main_~i~0 % 2), main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~0, 4); 16#L14-2true call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 9#L19true assume !(0 != main_#t~mem2);havoc main_#t~mem2; 8#L10-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 5#L10-3true [2018-12-08 10:02:38,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 10:02:38,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:38,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:38,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:38,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash 38268879, now seen corresponding path program 1 times [2018-12-08 10:02:38,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:38,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708365, now seen corresponding path program 1 times [2018-12-08 10:02:39,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:39,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:02:39,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:02:39,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:02:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:02:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:02:39,254 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-12-08 10:02:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:02:39,300 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-12-08 10:02:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:02:39,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-12-08 10:02:39,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-12-08 10:02:39,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2018-12-08 10:02:39,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 10:02:39,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 10:02:39,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-12-08 10:02:39,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:02:39,307 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-08 10:02:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-12-08 10:02:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-08 10:02:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-08 10:02:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-12-08 10:02:39,324 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-08 10:02:39,324 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-08 10:02:39,324 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 10:02:39,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-12-08 10:02:39,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 10:02:39,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:02:39,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:02:39,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:02:39,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 10:02:39,325 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 61#L10-3 [2018-12-08 10:02:39,325 INFO L796 eck$LassoCheckResult]: Loop: 61#L10-3 assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 62#L14 assume !(0 == main_~q~0); 71#L14-2 call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 72#L19 assume !(0 != main_#t~mem2);havoc main_#t~mem2; 64#L10-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 61#L10-3 [2018-12-08 10:02:39,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,326 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 10:02:39,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:39,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 38328461, now seen corresponding path program 1 times [2018-12-08 10:02:39,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:02:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1809767947, now seen corresponding path program 1 times [2018-12-08 10:02:39,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:39,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:39,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,438 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:02:39,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:02:39,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:02:39,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:02:39,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:02:39,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:39,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:02:39,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:02:39,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-12-08 10:02:39,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:02:39,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:02:39,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:02:39,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:02:39,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:39,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:02:39,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:39,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:39,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:02:39,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:39,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:39,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,656 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 10:02:39,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,658 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 10:02:39,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:39,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:39,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:02:39,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:39,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:02:39,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:39,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:02:39,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:39,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:02:39,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:02:39,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,690 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:02:39,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,692 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:02:39,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,697 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:02:39,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:02:39,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:02:39,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:02:39,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:39,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:39,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:39,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:39,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:39,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:39,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:02:39,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:02:39,735 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:02:39,741 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 10:02:39,741 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:02:39,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:02:39,744 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:02:39,744 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:02:39,745 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2018-12-08 10:02:39,761 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-08 10:02:39,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:39,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:02:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:39,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:02:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:02:39,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 10:02:39,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-08 10:02:39,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 36 transitions. Complement of second has 7 states. [2018-12-08 10:02:39,846 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-12-08 10:02:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 10:02:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 10:02:39,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-08 10:02:39,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:02:39,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-08 10:02:39,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:02:39,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-08 10:02:39,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:02:39,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2018-12-08 10:02:39,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:02:39,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 23 transitions. [2018-12-08 10:02:39,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 10:02:39,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 10:02:39,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-12-08 10:02:39,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:02:39,851 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 10:02:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-12-08 10:02:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-08 10:02:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 10:02:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-08 10:02:39,852 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 10:02:39,852 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 10:02:39,852 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 10:02:39,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-08 10:02:39,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:02:39,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:02:39,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:02:39,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 10:02:39,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:02:39,853 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 171#L10-3 assume !(main_~i~0 < 100000); 169#L10-4 call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; 170#L32-3 [2018-12-08 10:02:39,854 INFO L796 eck$LassoCheckResult]: Loop: 170#L32-3 assume !!(main_~i~0 < 100000); 174#L34 assume !(15000 == main_~i~0); 178#L32-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 170#L32-3 [2018-12-08 10:02:39,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2018-12-08 10:02:39,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:39,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:02:39,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:02:39,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:02:39,867 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:02:39,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 71947, now seen corresponding path program 1 times [2018-12-08 10:02:39,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:02:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:02:39,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:02:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:02:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:02:39,880 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:02:39,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:02:39,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:02:39,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:02:39,881 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 10:02:39,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:39,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:02:39,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:02:39,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration3_Loop [2018-12-08 10:02:39,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:02:39,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:02:39,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:39,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:02:39,918 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:39,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 10:02:39,921 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 10:02:39,924 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 10:02:39,924 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:39,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 10:02:39,939 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_366b16fa-36d0-46d9-9413-4eebaec7ec46/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:39,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 10:02:39,956 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 10:02:40,033 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 10:02:40,035 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:02:40,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:02:40,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:02:40,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:02:40,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:02:40,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:02:40,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:02:40,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:02:40,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration3_Loop [2018-12-08 10:02:40,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:02:40,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:02:40,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:40,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:02:40,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:02:40,077 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:02:40,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:40,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:40,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:40,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:40,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:02:40,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:40,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:02:40,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:40,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:02:40,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:02:40,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:02:40,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:02:40,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:02:40,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 10:02:40,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:02:40,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 10:02:40,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:02:40,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:02:40,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 10:02:40,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:02:40,086 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:02:40,086 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 10:02:40,086 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:02:40,086 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2018-12-08 10:02:40,087 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 10:02:40,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:02:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:40,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:02:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:02:40,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:02:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:02:40,123 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-12-08 10:02:40,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 10:02:40,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2018-12-08 10:02:40,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 10:02:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 10:02:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-12-08 10:02:40,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2018-12-08 10:02:40,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:02:40,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 10:02:40,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:02:40,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-08 10:02:40,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:02:40,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2018-12-08 10:02:40,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:02:40,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2018-12-08 10:02:40,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 10:02:40,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 10:02:40,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 10:02:40,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:02:40,136 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:02:40,136 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:02:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:02:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:02:40,137 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-08 10:02:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:02:40,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-08 10:02:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 10:02:40,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-08 10:02:40,137 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:02:40,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 10:02:40,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 10:02:40,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 10:02:40,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 10:02:40,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:02:40,137 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:02:40,138 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:02:40,138 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:02:40,138 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 10:02:40,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:02:40,138 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:02:40,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 10:02:40,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 10:02:40 BoogieIcfgContainer [2018-12-08 10:02:40,143 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 10:02:40,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:02:40,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:02:40,143 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:02:40,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:02:38" (3/4) ... [2018-12-08 10:02:40,147 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 10:02:40,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:02:40,147 INFO L168 Benchmark]: Toolchain (without parser) took 1638.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 954.4 MB in the beginning and 871.3 MB in the end (delta: 83.0 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:40,149 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:02:40,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.19 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:40,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:40,150 INFO L168 Benchmark]: Boogie Preprocessor took 44.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:40,151 INFO L168 Benchmark]: RCFGBuilder took 140.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:40,151 INFO L168 Benchmark]: BuchiAutomizer took 1293.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 874.0 MB in the end (delta: 224.2 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. [2018-12-08 10:02:40,151 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.1 GB. Free memory is still 871.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:02:40,154 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.19 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 140.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1293.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 874.0 MB in the end (delta: 224.2 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.1 GB. Free memory is still 871.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 58 SDslu, 29 SDs, 0 SdLazy, 62 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp95 ukn84 mio100 lsp83 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf143 smp94 tf103 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...