./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/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 54e32ac14491e98c150c8fd937f55676029a26c7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:27:57,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:27:57,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:27:57,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:27:57,348 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:27:57,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:27:57,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:27:57,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:27:57,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:27:57,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:27:57,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:27:57,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:27:57,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:27:57,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:27:57,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:27:57,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:27:57,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:27:57,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:27:57,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:27:57,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:27:57,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:27:57,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:27:57,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:27:57,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:27:57,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:27:57,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:27:57,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:27:57,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:27:57,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:27:57,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:27:57,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:27:57,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:27:57,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:27:57,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:27:57,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:27:57,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:27:57,373 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:27:57,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:27:57,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:27:57,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:27:57,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:27:57,388 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:27:57,388 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:27:57,388 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:27:57,388 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:27:57,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:27:57,389 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:27:57,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:27:57,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:27:57,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:27:57,390 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:27:57,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:27:57,390 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:27:57,391 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:27:57,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:27:57,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:27:57,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:27:57,391 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:27:57,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:27:57,391 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:27:57,391 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:27:57,392 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:27:57,392 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_e19f3fb1-6cb6-478e-8b07-267dee9a1279/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 -> 54e32ac14491e98c150c8fd937f55676029a26c7 [2018-11-18 13:27:57,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:27:57,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:27:57,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:27:57,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:27:57,436 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:27:57,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-18 13:27:57,487 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/data/6fb63699c/494ac27378e644c0826c1f503ec07ecf/FLAGc26a34ce6 [2018-11-18 13:27:57,829 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:27:57,830 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-18 13:27:57,834 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/data/6fb63699c/494ac27378e644c0826c1f503ec07ecf/FLAGc26a34ce6 [2018-11-18 13:27:57,845 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/data/6fb63699c/494ac27378e644c0826c1f503ec07ecf [2018-11-18 13:27:57,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:27:57,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:27:57,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:27:57,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:27:57,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:27:57,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:27:57" (1/1) ... [2018-11-18 13:27:57,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a19fc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:57, skipping insertion in model container [2018-11-18 13:27:57,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:27:57" (1/1) ... [2018-11-18 13:27:57,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:27:57,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:27:57,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:27:57,990 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:27:58,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:27:58,018 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:27:58,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58 WrapperNode [2018-11-18 13:27:58,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:27:58,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:27:58,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:27:58,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:27:58,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:27:58,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:27:58,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:27:58,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:27:58,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... [2018-11-18 13:27:58,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:27:58,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:27:58,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:27:58,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:27:58,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:27:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:27:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:27:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:27:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:27:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:27:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:27:58,280 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:27:58,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:27:58 BoogieIcfgContainer [2018-11-18 13:27:58,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:27:58,281 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:27:58,282 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:27:58,285 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:27:58,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:27:58,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:27:57" (1/3) ... [2018-11-18 13:27:58,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66656f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:27:58, skipping insertion in model container [2018-11-18 13:27:58,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:27:58,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:27:58" (2/3) ... [2018-11-18 13:27:58,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66656f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:27:58, skipping insertion in model container [2018-11-18 13:27:58,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:27:58,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:27:58" (3/3) ... [2018-11-18 13:27:58,289 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-18 13:27:58,336 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:27:58,337 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:27:58,337 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:27:58,337 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:27:58,337 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:27:58,338 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:27:58,338 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:27:58,338 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:27:58,338 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:27:58,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 13:27:58,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:27:58,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:27:58,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:27:58,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:27:58,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:27:58,378 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:27:58,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 13:27:58,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:27:58,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:27:58,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:27:58,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:27:58,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:27:58,387 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 16#L7-4true [2018-11-18 13:27:58,388 INFO L796 eck$LassoCheckResult]: Loop: 16#L7-4true assume true; 3#L7-1true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 19#L7-3true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 16#L7-4true [2018-11-18 13:27:58,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:58,394 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 13:27:58,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:58,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:58,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:58,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:58,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 13:27:58,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:58,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 13:27:58,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:58,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:58,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:58,643 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:27:58,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:27:58,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:27:58,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:27:58,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:27:58,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:27:58,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:27:58,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:27:58,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 13:27:58,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:27:58,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:27:58,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:58,843 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:27:58,847 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:27:58,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:58,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:58,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:58,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:58,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:58,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:58,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:58,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:58,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:58,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:58,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:58,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:58,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:58,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:58,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:58,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:58,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:58,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:58,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:58,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:58,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:58,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:58,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:58,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:58,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:58,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:58,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:58,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:58,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:58,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:58,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:58,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:27:58,959 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 13:27:58,959 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 13:27:58,961 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:27:58,962 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:27:58,962 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:27:58,963 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~i~0 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2018-11-18 13:27:58,970 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 13:27:58,978 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 13:27:59,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:27:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:27:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:27:59,064 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-18 13:27:59,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-18 13:27:59,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 33 states and 43 transitions. Complement of second has 8 states. [2018-11-18 13:27:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:27:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:27:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-18 13:27:59,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 13:27:59,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:27:59,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 13:27:59,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:27:59,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 13:27:59,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:27:59,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-18 13:27:59,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:27:59,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 15 states and 19 transitions. [2018-11-18 13:27:59,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 13:27:59,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 13:27:59,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-18 13:27:59,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:27:59,113 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 13:27:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-18 13:27:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 13:27:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 13:27:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-18 13:27:59,134 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 13:27:59,134 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-18 13:27:59,134 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:27:59,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-18 13:27:59,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:27:59,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:27:59,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:27:59,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:27:59,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:27:59,136 INFO L794 eck$LassoCheckResult]: Stem: 109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 105#L7-4 assume true; 97#L7-1 assume !(main_~i~0 < 100000); 98#L7-5 main_~i~0 := 0; 101#L11-4 [2018-11-18 13:27:59,136 INFO L796 eck$LassoCheckResult]: Loop: 101#L11-4 assume true; 102#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 108#L2 assume !(0 == __VERIFIER_assert_~cond); 106#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 107#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 103#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 101#L11-4 [2018-11-18 13:27:59,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 13:27:59,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:59,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:59,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:27:59,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:27:59,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:27:59,168 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:27:59,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1513745356, now seen corresponding path program 1 times [2018-11-18 13:27:59,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:59,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:59,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:27:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:27:59,355 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 13:27:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:27:59,376 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-18 13:27:59,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:27:59,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-11-18 13:27:59,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:27:59,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 24 transitions. [2018-11-18 13:27:59,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 13:27:59,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 13:27:59,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-18 13:27:59,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:27:59,381 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 13:27:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-18 13:27:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-11-18 13:27:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 13:27:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-18 13:27:59,384 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 13:27:59,384 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 13:27:59,384 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:27:59,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-11-18 13:27:59,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:27:59,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:27:59,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:27:59,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:27:59,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:27:59,386 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 146#L7-4 assume true; 152#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 153#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 157#L7-4 assume true; 150#L7-1 assume !(main_~i~0 < 100000); 151#L7-5 main_~i~0 := 0; 155#L11-4 assume true; 161#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 160#L2 assume !(0 == __VERIFIER_assert_~cond); 159#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 158#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 156#L11-3 [2018-11-18 13:27:59,387 INFO L796 eck$LassoCheckResult]: Loop: 156#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 154#L11-4 assume true; 147#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 148#L2 assume !(0 == __VERIFIER_assert_~cond); 143#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 144#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 156#L11-3 [2018-11-18 13:27:59,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash -556496682, now seen corresponding path program 1 times [2018-11-18 13:27:59,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:27:59,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:27:59,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:27:59,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:27:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:27:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:27:59,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 13:27:59,491 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:27:59,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2110129366, now seen corresponding path program 2 times [2018-11-18 13:27:59,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:59,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:59,677 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-18 13:27:59,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:27:59,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:27:59,678 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-18 13:27:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:27:59,721 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-18 13:27:59,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:27:59,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-18 13:27:59,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:27:59,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 33 transitions. [2018-11-18 13:27:59,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 13:27:59,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 13:27:59,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-18 13:27:59,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:27:59,725 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 13:27:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-18 13:27:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-18 13:27:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 13:27:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-18 13:27:59,729 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-18 13:27:59,729 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-18 13:27:59,729 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:27:59,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-11-18 13:27:59,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:27:59,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:27:59,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:27:59,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 13:27:59,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:27:59,731 INFO L794 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 239#L7-4 assume true; 247#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 248#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 252#L7-4 assume true; 253#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 256#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 255#L7-4 assume true; 245#L7-1 assume !(main_~i~0 < 100000); 246#L7-5 main_~i~0 := 0; 250#L11-4 assume true; 265#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 264#L2 assume !(0 == __VERIFIER_assert_~cond); 263#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 262#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 251#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 249#L11-4 assume true; 242#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 243#L2 assume !(0 == __VERIFIER_assert_~cond); 240#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 241#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 254#L11-3 [2018-11-18 13:27:59,731 INFO L796 eck$LassoCheckResult]: Loop: 254#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 261#L11-4 assume true; 260#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 259#L2 assume !(0 == __VERIFIER_assert_~cond); 258#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 257#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 254#L11-3 [2018-11-18 13:27:59,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1925675177, now seen corresponding path program 1 times [2018-11-18 13:27:59,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:59,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:59,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:27:59,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 13:27:59,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:27:59,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:27:59,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:59,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:27:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 13:27:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:27:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 13:27:59,823 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:27:59,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2110129366, now seen corresponding path program 3 times [2018-11-18 13:27:59,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:27:59,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:27:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:27:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:27:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:27:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:27:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:27:59,974 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-18 13:28:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:28:00,005 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 13:28:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:28:00,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-11-18 13:28:00,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:28:00,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 42 transitions. [2018-11-18 13:28:00,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-18 13:28:00,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-18 13:28:00,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2018-11-18 13:28:00,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:28:00,008 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-18 13:28:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2018-11-18 13:28:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-18 13:28:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 13:28:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-18 13:28:00,012 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-18 13:28:00,012 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-18 13:28:00,012 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:28:00,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2018-11-18 13:28:00,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:28:00,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:28:00,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:28:00,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-11-18 13:28:00,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:28:00,018 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 379#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 380#L7-4 assume true; 388#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 389#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 394#L7-4 assume true; 395#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 397#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 398#L7-4 assume true; 400#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 401#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 399#L7-4 assume true; 386#L7-1 assume !(main_~i~0 < 100000); 387#L7-5 main_~i~0 := 0; 391#L11-4 assume true; 415#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 414#L2 assume !(0 == __VERIFIER_assert_~cond); 413#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 412#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 393#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 390#L11-4 assume true; 383#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 384#L2 assume !(0 == __VERIFIER_assert_~cond); 392#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 407#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 408#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 411#L11-4 assume true; 410#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 409#L2 assume !(0 == __VERIFIER_assert_~cond); 381#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 382#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 396#L11-3 [2018-11-18 13:28:00,018 INFO L796 eck$LassoCheckResult]: Loop: 396#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 406#L11-4 assume true; 405#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 404#L2 assume !(0 == __VERIFIER_assert_~cond); 403#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 402#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 396#L11-3 [2018-11-18 13:28:00,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:28:00,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1236956800, now seen corresponding path program 2 times [2018-11-18 13:28:00,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:28:00,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:28:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:28:00,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:28:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 13:28:00,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:28:00,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:28:00,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:28:00,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:28:00,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:28:00,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:28:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 13:28:00,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:28:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 13:28:00,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:28:00,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:28:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2110129366, now seen corresponding path program 4 times [2018-11-18 13:28:00,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:28:00,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:28:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:28:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:28:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:28:00,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:28:00,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:28:00,323 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-18 13:28:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:28:00,368 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-18 13:28:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:28:00,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 52 transitions. [2018-11-18 13:28:00,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:28:00,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 51 transitions. [2018-11-18 13:28:00,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 13:28:00,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 13:28:00,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 51 transitions. [2018-11-18 13:28:00,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:28:00,371 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-18 13:28:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 51 transitions. [2018-11-18 13:28:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-18 13:28:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 13:28:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-18 13:28:00,374 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-18 13:28:00,374 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-18 13:28:00,374 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:28:00,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 48 transitions. [2018-11-18 13:28:00,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 13:28:00,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:28:00,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:28:00,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2018-11-18 13:28:00,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:28:00,377 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(400000);main_~i~0 := 0; 567#L7-4 assume true; 575#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 576#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 581#L7-4 assume true; 582#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 583#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 584#L7-4 assume true; 590#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 589#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 588#L7-4 assume true; 586#L7-1 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 587#L7-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 585#L7-4 assume true; 573#L7-1 assume !(main_~i~0 < 100000); 574#L7-5 main_~i~0 := 0; 578#L11-4 assume true; 611#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 610#L2 assume !(0 == __VERIFIER_assert_~cond); 568#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 569#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 580#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 577#L11-4 assume true; 570#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 571#L2 assume !(0 == __VERIFIER_assert_~cond); 579#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 609#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 608#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 607#L11-4 assume true; 606#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 605#L2 assume !(0 == __VERIFIER_assert_~cond); 604#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 603#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 602#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 601#L11-4 assume true; 600#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 599#L2 assume !(0 == __VERIFIER_assert_~cond); 598#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 597#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 592#L11-3 [2018-11-18 13:28:00,377 INFO L796 eck$LassoCheckResult]: Loop: 592#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 596#L11-4 assume true; 595#L11-1 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 594#L2 assume !(0 == __VERIFIER_assert_~cond); 593#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 591#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 592#L11-3 [2018-11-18 13:28:00,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:28:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1303645011, now seen corresponding path program 3 times [2018-11-18 13:28:00,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:28:00,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:28:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:28:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:28:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 13:28:00,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:28:00,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e19f3fb1-6cb6-478e-8b07-267dee9a1279/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:28:00,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:28:00,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 13:28:00,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:28:00,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:28:00,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 13:28:00,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 13:28:00,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:28:00,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:28:00,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:28:00,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-18 13:28:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 13:28:00,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:28:00,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-18 13:28:00,565 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:28:00,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:28:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2110129366, now seen corresponding path program 5 times [2018-11-18 13:28:00,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:28:00,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:28:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:28:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:28:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:28:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:28:00,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:28:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:28:00,673 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-11-18 13:28:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:28:00,734 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-18 13:28:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:28:00,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 32 transitions. [2018-11-18 13:28:00,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:28:00,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2018-11-18 13:28:00,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:28:00,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:28:00,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:28:00,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:28:00,736 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:28:00,736 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:28:00,736 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:28:00,736 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:28:00,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:28:00,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:28:00,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:28:00,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:28:00 BoogieIcfgContainer [2018-11-18 13:28:00,741 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:28:00,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:28:00,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:28:00,741 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:28:00,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:27:58" (3/4) ... [2018-11-18 13:28:00,745 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:28:00,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:28:00,746 INFO L168 Benchmark]: Toolchain (without parser) took 2898.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:00,747 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:28:00,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 943.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:00,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.98 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:00,749 INFO L168 Benchmark]: Boogie Preprocessor took 61.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:00,750 INFO L168 Benchmark]: RCFGBuilder took 170.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:00,750 INFO L168 Benchmark]: BuchiAutomizer took 2459.29 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: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:00,751 INFO L168 Benchmark]: Witness Printer took 4.35 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-18 13:28:00,756 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 943.1 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 28.98 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 170.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2459.29 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: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 199999 * unknown-#length-unknown[a] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 7 iterations. TraceHistogramMax:5. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 82 SDslu, 91 SDs, 0 SdLazy, 153 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp93 ukn58 mio100 lsp72 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...