./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/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 9f5fbba39a6c3cc8a650e9b9b88c73e3f7d08064 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:50,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:50,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:50,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:50,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:50,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:50,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:50,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:50,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:50,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:50,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:50,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:50,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:50,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:50,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:50,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:50,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:50,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:50,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:50,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:50,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:50,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:50,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:50,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:50,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:50,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:50,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:50,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:50,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:50,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:50,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:50,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:50,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:50,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:50,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:50,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:50,058 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:06:50,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:50,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:50,078 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:50,078 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:50,078 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:50,078 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:50,078 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:50,079 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:50,079 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:50,079 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:50,079 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:50,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:50,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:06:50,079 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:06:50,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:50,081 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:50,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:50,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:50,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:50,081 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:50,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:50,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:50,082 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:50,084 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:50,084 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_595967f8-5cae-425f-b9f4-51015561fc3b/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 -> 9f5fbba39a6c3cc8a650e9b9b88c73e3f7d08064 [2018-10-27 06:06:50,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:50,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:50,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:50,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:50,135 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:50,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-10-27 06:06:50,178 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/data/cb64ff13f/05fcbc39f0d049f7b11388e7c58bd676/FLAG670592d3e [2018-10-27 06:06:50,520 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:50,520 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-10-27 06:06:50,526 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/data/cb64ff13f/05fcbc39f0d049f7b11388e7c58bd676/FLAG670592d3e [2018-10-27 06:06:50,536 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/data/cb64ff13f/05fcbc39f0d049f7b11388e7c58bd676 [2018-10-27 06:06:50,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:50,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:50,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:50,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:50,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:50,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c601163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50, skipping insertion in model container [2018-10-27 06:06:50,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:50,575 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:50,702 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:50,710 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:50,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:50,742 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:50,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50 WrapperNode [2018-10-27 06:06:50,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:50,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:50,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:50,743 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:50,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:50,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:50,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:50,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:50,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... [2018-10-27 06:06:50,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:50,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:50,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:50,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:50,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/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-10-27 06:06:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:51,483 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:51,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:51 BoogieIcfgContainer [2018-10-27 06:06:51,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:51,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:51,485 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:51,488 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:51,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:51,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:50" (1/3) ... [2018-10-27 06:06:51,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cfe2a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:51, skipping insertion in model container [2018-10-27 06:06:51,490 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:51,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:50" (2/3) ... [2018-10-27 06:06:51,491 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cfe2a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:51, skipping insertion in model container [2018-10-27 06:06:51,491 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:51,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:51" (3/3) ... [2018-10-27 06:06:51,492 INFO L375 chiAutomizerObserver]: Analyzing ICFG max10_true-unreach-call_true-termination.i [2018-10-27 06:06:51,548 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:51,549 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:51,549 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:51,549 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:51,549 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:51,549 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:51,550 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:51,550 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:51,550 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:51,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-10-27 06:06:51,591 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2018-10-27 06:06:51,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:51,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:51,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:51,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:51,598 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:51,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-10-27 06:06:51,601 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2018-10-27 06:06:51,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:51,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:51,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:51,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:51,609 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 18#L23-4true [2018-10-27 06:06:51,610 INFO L795 eck$LassoCheckResult]: Loop: 18#L23-4true assume true; 41#L23-1true assume !!(main_~i~1 < 10); 59#L24true SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 57#L24-1true havoc main_#t~nondet5; 21#L23-3true main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 18#L23-4true [2018-10-27 06:06:51,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:06:51,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-10-27 06:06:51,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-10-27 06:06:51,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,905 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:06:52,127 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:52,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:52,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:52,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:52,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:52,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:52,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:52,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:52,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:06:52,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:52,130 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:52,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,478 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-27 06:06:52,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,815 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 06:06:53,155 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:53,160 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:53,161 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-10-27 06:06:53,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,169 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-10-27 06:06:53,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,181 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-10-27 06:06:53,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,183 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-10-27 06:06:53,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,192 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-10-27 06:06:53,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,196 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-10-27 06:06:53,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,199 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-10-27 06:06:53,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,207 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-10-27 06:06:53,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,210 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-10-27 06:06:53,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,213 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-10-27 06:06:53,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,216 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-10-27 06:06:53,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,219 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-10-27 06:06:53,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,221 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-10-27 06:06:53,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,241 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-10-27 06:06:53,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,307 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:53,347 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:06:53,348 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:06:53,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:53,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:53,352 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:53,352 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-10-27 06:06:53,398 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:06:53,407 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:06:53,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:53,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:06:53,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:53,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:53,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:53,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:06:53,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states. Second operand 5 states. [2018-10-27 06:06:53,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states.. Second operand 5 states. Result 168 states and 201 transitions. Complement of second has 10 states. [2018-10-27 06:06:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:06:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2018-10-27 06:06:53,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 2 letters. Loop has 5 letters. [2018-10-27 06:06:53,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:53,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:06:53,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:53,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 2 letters. Loop has 10 letters. [2018-10-27 06:06:53,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:53,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 201 transitions. [2018-10-27 06:06:53,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:53,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 55 states and 63 transitions. [2018-10-27 06:06:53,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-10-27 06:06:53,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:53,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-10-27 06:06:53,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:53,882 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-10-27 06:06:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-10-27 06:06:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-27 06:06:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:06:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-10-27 06:06:53,910 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-10-27 06:06:53,910 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-10-27 06:06:53,910 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:53,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2018-10-27 06:06:53,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:53,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:53,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:53,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:53,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:53,913 INFO L793 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 304#L23-4 assume true; 320#L23-1 assume !(main_~i~1 < 10); 317#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 318#L9-4 [2018-10-27 06:06:53,913 INFO L795 eck$LassoCheckResult]: Loop: 318#L9-4 assume true; 329#L9-1 assume !!(max_~i~0 < 10); 308#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 309#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 344#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 332#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 318#L9-4 [2018-10-27 06:06:53,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2018-10-27 06:06:53,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:53,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:53,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:53,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:53,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:53,971 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:53,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 1 times [2018-10-27 06:06:53,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:54,061 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-10-27 06:06:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:54,097 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-10-27 06:06:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:54,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 67 transitions. [2018-10-27 06:06:54,100 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:54,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 66 transitions. [2018-10-27 06:06:54,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:54,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:54,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 66 transitions. [2018-10-27 06:06:54,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:54,101 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-10-27 06:06:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 66 transitions. [2018-10-27 06:06:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-10-27 06:06:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:06:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-10-27 06:06:54,105 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-10-27 06:06:54,105 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-10-27 06:06:54,105 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:54,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 62 transitions. [2018-10-27 06:06:54,106 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:54,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:54,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:54,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,107 INFO L793 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 427#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 428#L23-4 assume true; 440#L23-1 assume !!(main_~i~1 < 10); 462#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 471#L24-1 havoc main_#t~nondet5; 445#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 441#L23-4 assume true; 442#L23-1 assume !(main_~i~1 < 10); 438#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 439#L9-4 [2018-10-27 06:06:54,107 INFO L795 eck$LassoCheckResult]: Loop: 439#L9-4 assume true; 450#L9-1 assume !!(max_~i~0 < 10); 429#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 430#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 465#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 453#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 439#L9-4 [2018-10-27 06:06:54,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2016318454, now seen corresponding path program 1 times [2018-10-27 06:06:54,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:54,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:54,158 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/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-10-27 06:06:54,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:54,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:54,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 06:06:54,235 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:54,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 2 times [2018-10-27 06:06:54,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:06:54,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:06:54,284 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-10-27 06:06:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:54,316 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-10-27 06:06:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:06:54,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 72 transitions. [2018-10-27 06:06:54,320 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:54,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 71 transitions. [2018-10-27 06:06:54,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:54,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:54,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 71 transitions. [2018-10-27 06:06:54,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:54,321 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-10-27 06:06:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 71 transitions. [2018-10-27 06:06:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-10-27 06:06:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:06:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-10-27 06:06:54,326 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-10-27 06:06:54,326 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-10-27 06:06:54,326 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:54,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 67 transitions. [2018-10-27 06:06:54,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:54,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:54,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:54,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-27 06:06:54,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,328 INFO L793 eck$LassoCheckResult]: Stem: 604#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 583#L23-4 assume true; 595#L23-1 assume !!(main_~i~1 < 10); 633#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 632#L24-1 havoc main_#t~nondet5; 600#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 596#L23-4 assume true; 597#L23-1 assume !!(main_~i~1 < 10); 618#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 627#L24-1 havoc main_#t~nondet5; 628#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 631#L23-4 assume true; 617#L23-1 assume !(main_~i~1 < 10); 593#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 594#L9-4 [2018-10-27 06:06:54,328 INFO L795 eck$LassoCheckResult]: Loop: 594#L9-4 assume true; 605#L9-1 assume !!(max_~i~0 < 10); 584#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 585#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 621#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 608#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 594#L9-4 [2018-10-27 06:06:54,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1843081005, now seen corresponding path program 2 times [2018-10-27 06:06:54,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:54,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:54,377 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/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-10-27 06:06:54,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:06:54,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:06:54,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:54,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:54,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:54,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-27 06:06:54,530 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:54,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 3 times [2018-10-27 06:06:54,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,791 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:06:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:06:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:06:54,817 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-10-27 06:06:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:54,839 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-10-27 06:06:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:06:54,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 77 transitions. [2018-10-27 06:06:54,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:54,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 76 transitions. [2018-10-27 06:06:54,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:54,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:54,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 76 transitions. [2018-10-27 06:06:54,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:54,844 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-10-27 06:06:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 76 transitions. [2018-10-27 06:06:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-27 06:06:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-27 06:06:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-10-27 06:06:54,848 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-10-27 06:06:54,848 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-10-27 06:06:54,848 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:54,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 72 transitions. [2018-10-27 06:06:54,849 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:54,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:54,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:54,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-10-27 06:06:54,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,850 INFO L793 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 761#L23-4 assume true; 776#L23-1 assume !!(main_~i~1 < 10); 819#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 818#L24-1 havoc main_#t~nondet5; 817#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 777#L23-4 assume true; 778#L23-1 assume !!(main_~i~1 < 10); 800#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 809#L24-1 havoc main_#t~nondet5; 781#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 782#L23-4 assume true; 813#L23-1 assume !!(main_~i~1 < 10); 816#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 815#L24-1 havoc main_#t~nondet5; 814#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 812#L23-4 assume true; 799#L23-1 assume !(main_~i~1 < 10); 774#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 775#L9-4 [2018-10-27 06:06:54,850 INFO L795 eck$LassoCheckResult]: Loop: 775#L9-4 assume true; 787#L9-1 assume !!(max_~i~0 < 10); 765#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 766#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 803#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 790#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 775#L9-4 [2018-10-27 06:06:54,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash -500373014, now seen corresponding path program 3 times [2018-10-27 06:06:54,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:54,953 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:06:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:54,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 06:06:54,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:54,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 06:06:55,033 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:55,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 4 times [2018-10-27 06:06:55,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:55,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:06:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:06:55,105 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-10-27 06:06:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:55,131 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-10-27 06:06:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:06:55,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 82 transitions. [2018-10-27 06:06:55,136 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:55,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 81 transitions. [2018-10-27 06:06:55,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:55,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:55,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 81 transitions. [2018-10-27 06:06:55,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:55,137 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-10-27 06:06:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 81 transitions. [2018-10-27 06:06:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-10-27 06:06:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 06:06:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-10-27 06:06:55,142 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-10-27 06:06:55,142 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-10-27 06:06:55,142 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:55,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 77 transitions. [2018-10-27 06:06:55,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:55,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:55,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:55,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-10-27 06:06:55,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:55,144 INFO L793 eck$LassoCheckResult]: Stem: 993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 971#L23-4 assume true; 983#L23-1 assume !!(main_~i~1 < 10); 1031#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1030#L24-1 havoc main_#t~nondet5; 1029#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 984#L23-4 assume true; 985#L23-1 assume !!(main_~i~1 < 10); 1007#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1016#L24-1 havoc main_#t~nondet5; 988#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 989#L23-4 assume true; 1028#L23-1 assume !!(main_~i~1 < 10); 1027#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1026#L24-1 havoc main_#t~nondet5; 1025#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1024#L23-4 assume true; 1020#L23-1 assume !!(main_~i~1 < 10); 1023#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1022#L24-1 havoc main_#t~nondet5; 1021#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1019#L23-4 assume true; 1006#L23-1 assume !(main_~i~1 < 10); 981#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 982#L9-4 [2018-10-27 06:06:55,144 INFO L795 eck$LassoCheckResult]: Loop: 982#L9-4 assume true; 994#L9-1 assume !!(max_~i~0 < 10); 972#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 973#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1010#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 997#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 982#L9-4 [2018-10-27 06:06:55,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:55,144 INFO L82 PathProgramCache]: Analyzing trace with hash 543382861, now seen corresponding path program 4 times [2018-10-27 06:06:55,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:55,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:55,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:55,236 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/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-10-27 06:06:55,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:06:55,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:06:55,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:55,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-27 06:06:55,303 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:55,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 5 times [2018-10-27 06:06:55,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:55,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:06:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:06:55,345 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-10-27 06:06:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:55,371 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-10-27 06:06:55,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:06:55,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 87 transitions. [2018-10-27 06:06:55,376 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:55,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 79 states and 86 transitions. [2018-10-27 06:06:55,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:55,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:55,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 86 transitions. [2018-10-27 06:06:55,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:55,377 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-10-27 06:06:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 86 transitions. [2018-10-27 06:06:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-10-27 06:06:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 06:06:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-10-27 06:06:55,383 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-10-27 06:06:55,383 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-10-27 06:06:55,383 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:06:55,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 82 transitions. [2018-10-27 06:06:55,384 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:55,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:55,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:55,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2018-10-27 06:06:55,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:55,385 INFO L793 eck$LassoCheckResult]: Stem: 1226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1204#L23-4 assume true; 1216#L23-1 assume !!(main_~i~1 < 10); 1269#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1268#L24-1 havoc main_#t~nondet5; 1267#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1217#L23-4 assume true; 1218#L23-1 assume !!(main_~i~1 < 10); 1240#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1249#L24-1 havoc main_#t~nondet5; 1221#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1222#L23-4 assume true; 1266#L23-1 assume !!(main_~i~1 < 10); 1265#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1264#L24-1 havoc main_#t~nondet5; 1263#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1262#L23-4 assume true; 1261#L23-1 assume !!(main_~i~1 < 10); 1260#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1259#L24-1 havoc main_#t~nondet5; 1258#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1257#L23-4 assume true; 1253#L23-1 assume !!(main_~i~1 < 10); 1256#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1255#L24-1 havoc main_#t~nondet5; 1254#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1252#L23-4 assume true; 1239#L23-1 assume !(main_~i~1 < 10); 1214#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1215#L9-4 [2018-10-27 06:06:55,385 INFO L795 eck$LassoCheckResult]: Loop: 1215#L9-4 assume true; 1227#L9-1 assume !!(max_~i~0 < 10); 1205#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 1206#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1243#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1230#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1215#L9-4 [2018-10-27 06:06:55,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash 975998922, now seen corresponding path program 5 times [2018-10-27 06:06:55,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:55,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:55,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:55,801 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:55,807 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:06:55,861 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-27 06:06:55,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:55,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:55,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:55,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:06:55,888 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 6 times [2018-10-27 06:06:55,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:06:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:06:55,945 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-10-27 06:06:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:55,973 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-10-27 06:06:55,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:06:55,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:06:55,976 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:55,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 91 transitions. [2018-10-27 06:06:55,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:55,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:55,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 91 transitions. [2018-10-27 06:06:55,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:55,978 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-10-27 06:06:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 91 transitions. [2018-10-27 06:06:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-10-27 06:06:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-27 06:06:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-10-27 06:06:55,983 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-10-27 06:06:55,984 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-10-27 06:06:55,984 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:06:55,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 87 transitions. [2018-10-27 06:06:55,984 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:55,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:55,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:55,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1] [2018-10-27 06:06:55,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:55,985 INFO L793 eck$LassoCheckResult]: Stem: 1485#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1463#L23-4 assume true; 1475#L23-1 assume !!(main_~i~1 < 10); 1533#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1532#L24-1 havoc main_#t~nondet5; 1531#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1476#L23-4 assume true; 1477#L23-1 assume !!(main_~i~1 < 10); 1499#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1508#L24-1 havoc main_#t~nondet5; 1480#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1481#L23-4 assume true; 1530#L23-1 assume !!(main_~i~1 < 10); 1529#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1528#L24-1 havoc main_#t~nondet5; 1527#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1526#L23-4 assume true; 1525#L23-1 assume !!(main_~i~1 < 10); 1524#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1523#L24-1 havoc main_#t~nondet5; 1522#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1521#L23-4 assume true; 1520#L23-1 assume !!(main_~i~1 < 10); 1519#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1518#L24-1 havoc main_#t~nondet5; 1517#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1516#L23-4 assume true; 1512#L23-1 assume !!(main_~i~1 < 10); 1515#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1514#L24-1 havoc main_#t~nondet5; 1513#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1511#L23-4 assume true; 1498#L23-1 assume !(main_~i~1 < 10); 1473#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1474#L9-4 [2018-10-27 06:06:55,985 INFO L795 eck$LassoCheckResult]: Loop: 1474#L9-4 assume true; 1486#L9-1 assume !!(max_~i~0 < 10); 1464#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 1465#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1502#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1489#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1474#L9-4 [2018-10-27 06:06:55,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash -39820435, now seen corresponding path program 6 times [2018-10-27 06:06:55,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:55,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:55,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:55,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:56,107 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:06:56,141 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-27 06:06:56,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:56,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:56,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-27 06:06:56,178 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:56,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 7 times [2018-10-27 06:06:56,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:56,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:06:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:06:56,230 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-10-27 06:06:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:56,262 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-10-27 06:06:56,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:06:56,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 97 transitions. [2018-10-27 06:06:56,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:56,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 89 states and 96 transitions. [2018-10-27 06:06:56,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:56,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:56,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 96 transitions. [2018-10-27 06:06:56,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:56,269 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-10-27 06:06:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 96 transitions. [2018-10-27 06:06:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-10-27 06:06:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 06:06:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-10-27 06:06:56,275 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-10-27 06:06:56,275 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-10-27 06:06:56,275 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:06:56,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 92 transitions. [2018-10-27 06:06:56,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:56,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:56,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:56,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1] [2018-10-27 06:06:56,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:56,280 INFO L793 eck$LassoCheckResult]: Stem: 1770#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1748#L23-4 assume true; 1760#L23-1 assume !!(main_~i~1 < 10); 1823#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1822#L24-1 havoc main_#t~nondet5; 1821#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1761#L23-4 assume true; 1762#L23-1 assume !!(main_~i~1 < 10); 1784#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1793#L24-1 havoc main_#t~nondet5; 1765#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1766#L23-4 assume true; 1820#L23-1 assume !!(main_~i~1 < 10); 1819#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1818#L24-1 havoc main_#t~nondet5; 1817#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1816#L23-4 assume true; 1815#L23-1 assume !!(main_~i~1 < 10); 1814#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1813#L24-1 havoc main_#t~nondet5; 1812#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1811#L23-4 assume true; 1810#L23-1 assume !!(main_~i~1 < 10); 1809#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1808#L24-1 havoc main_#t~nondet5; 1807#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1806#L23-4 assume true; 1805#L23-1 assume !!(main_~i~1 < 10); 1804#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1803#L24-1 havoc main_#t~nondet5; 1802#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1801#L23-4 assume true; 1797#L23-1 assume !!(main_~i~1 < 10); 1800#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1799#L24-1 havoc main_#t~nondet5; 1798#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 1796#L23-4 assume true; 1783#L23-1 assume !(main_~i~1 < 10); 1758#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1759#L9-4 [2018-10-27 06:06:56,280 INFO L795 eck$LassoCheckResult]: Loop: 1759#L9-4 assume true; 1771#L9-1 assume !!(max_~i~0 < 10); 1749#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 1750#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1787#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1774#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 1759#L9-4 [2018-10-27 06:06:56,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1900126806, now seen corresponding path program 7 times [2018-10-27 06:06:56,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:56,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:56,376 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:56,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:56,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 06:06:56,582 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:56,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 8 times [2018-10-27 06:06:56,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:06:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:06:56,686 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-10-27 06:06:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:56,725 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-10-27 06:06:56,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:06:56,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions. [2018-10-27 06:06:56,727 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:56,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 94 states and 101 transitions. [2018-10-27 06:06:56,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:56,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:56,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 101 transitions. [2018-10-27 06:06:56,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:56,728 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-10-27 06:06:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 101 transitions. [2018-10-27 06:06:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-10-27 06:06:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-27 06:06:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-10-27 06:06:56,734 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-10-27 06:06:56,734 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-10-27 06:06:56,734 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:06:56,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 97 transitions. [2018-10-27 06:06:56,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:56,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:56,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:56,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1] [2018-10-27 06:06:56,735 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:56,735 INFO L793 eck$LassoCheckResult]: Stem: 2080#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2055#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2056#L23-4 assume true; 2071#L23-1 assume !!(main_~i~1 < 10); 2139#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2138#L24-1 havoc main_#t~nondet5; 2137#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2072#L23-4 assume true; 2073#L23-1 assume !!(main_~i~1 < 10); 2095#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2104#L24-1 havoc main_#t~nondet5; 2076#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2077#L23-4 assume true; 2136#L23-1 assume !!(main_~i~1 < 10); 2135#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2134#L24-1 havoc main_#t~nondet5; 2133#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2132#L23-4 assume true; 2131#L23-1 assume !!(main_~i~1 < 10); 2130#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2129#L24-1 havoc main_#t~nondet5; 2128#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2127#L23-4 assume true; 2126#L23-1 assume !!(main_~i~1 < 10); 2125#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2124#L24-1 havoc main_#t~nondet5; 2123#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2122#L23-4 assume true; 2121#L23-1 assume !!(main_~i~1 < 10); 2120#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2119#L24-1 havoc main_#t~nondet5; 2118#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2117#L23-4 assume true; 2116#L23-1 assume !!(main_~i~1 < 10); 2115#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2114#L24-1 havoc main_#t~nondet5; 2113#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2112#L23-4 assume true; 2108#L23-1 assume !!(main_~i~1 < 10); 2111#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2110#L24-1 havoc main_#t~nondet5; 2109#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2107#L23-4 assume true; 2094#L23-1 assume !(main_~i~1 < 10); 2069#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2070#L9-4 [2018-10-27 06:06:56,736 INFO L795 eck$LassoCheckResult]: Loop: 2070#L9-4 assume true; 2082#L9-1 assume !!(max_~i~0 < 10); 2060#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2061#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2098#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2085#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2070#L9-4 [2018-10-27 06:06:56,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 727990669, now seen corresponding path program 8 times [2018-10-27 06:06:56,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:56,828 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:56,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:06:56,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:06:56,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:56,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-10-27 06:06:56,888 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:56,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 9 times [2018-10-27 06:06:56,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:56,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,027 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:06:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:06:57,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:06:57,040 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. cyclomatic complexity: 12 Second operand 12 states. [2018-10-27 06:06:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:57,074 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-10-27 06:06:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:06:57,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 107 transitions. [2018-10-27 06:06:57,075 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:57,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 99 states and 106 transitions. [2018-10-27 06:06:57,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:57,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:57,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 106 transitions. [2018-10-27 06:06:57,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:57,076 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-10-27 06:06:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 106 transitions. [2018-10-27 06:06:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-10-27 06:06:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-27 06:06:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-10-27 06:06:57,080 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-10-27 06:06:57,080 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-10-27 06:06:57,080 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:06:57,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions. [2018-10-27 06:06:57,081 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:57,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:57,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:57,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1] [2018-10-27 06:06:57,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:57,082 INFO L793 eck$LassoCheckResult]: Stem: 2418#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2396#L23-4 assume true; 2408#L23-1 assume !!(main_~i~1 < 10); 2481#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2480#L24-1 havoc main_#t~nondet5; 2479#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2409#L23-4 assume true; 2410#L23-1 assume !!(main_~i~1 < 10); 2432#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2441#L24-1 havoc main_#t~nondet5; 2413#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2414#L23-4 assume true; 2478#L23-1 assume !!(main_~i~1 < 10); 2477#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2476#L24-1 havoc main_#t~nondet5; 2475#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2474#L23-4 assume true; 2473#L23-1 assume !!(main_~i~1 < 10); 2472#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2471#L24-1 havoc main_#t~nondet5; 2470#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2469#L23-4 assume true; 2468#L23-1 assume !!(main_~i~1 < 10); 2467#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2466#L24-1 havoc main_#t~nondet5; 2465#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2464#L23-4 assume true; 2463#L23-1 assume !!(main_~i~1 < 10); 2462#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2461#L24-1 havoc main_#t~nondet5; 2460#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2459#L23-4 assume true; 2458#L23-1 assume !!(main_~i~1 < 10); 2457#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2456#L24-1 havoc main_#t~nondet5; 2455#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2454#L23-4 assume true; 2453#L23-1 assume !!(main_~i~1 < 10); 2452#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2451#L24-1 havoc main_#t~nondet5; 2450#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2449#L23-4 assume true; 2445#L23-1 assume !!(main_~i~1 < 10); 2448#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2447#L24-1 havoc main_#t~nondet5; 2446#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2444#L23-4 assume true; 2431#L23-1 assume !(main_~i~1 < 10); 2406#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2407#L9-4 [2018-10-27 06:06:57,082 INFO L795 eck$LassoCheckResult]: Loop: 2407#L9-4 assume true; 2419#L9-1 assume !!(max_~i~0 < 10); 2397#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2398#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2435#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2422#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2407#L9-4 [2018-10-27 06:06:57,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115574, now seen corresponding path program 9 times [2018-10-27 06:06:57,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:57,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:57,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:57,276 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:57,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:06:57,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-27 06:06:57,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:57,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 06:06:57,465 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:57,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 10 times [2018-10-27 06:06:57,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,739 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:06:57,951 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:06:57,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:06:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:06:57,952 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-10-27 06:06:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:58,281 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-10-27 06:06:58,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:06:58,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 109 transitions. [2018-10-27 06:06:58,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:58,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 101 states and 108 transitions. [2018-10-27 06:06:58,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:06:58,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:06:58,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 108 transitions. [2018-10-27 06:06:58,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:58,284 INFO L705 BuchiCegarLoop]: Abstraction has 101 states and 108 transitions. [2018-10-27 06:06:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 108 transitions. [2018-10-27 06:06:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-27 06:06:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 06:06:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-10-27 06:06:58,290 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-10-27 06:06:58,290 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-10-27 06:06:58,290 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:06:58,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 107 transitions. [2018-10-27 06:06:58,291 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-10-27 06:06:58,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:58,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:58,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1] [2018-10-27 06:06:58,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:58,292 INFO L793 eck$LassoCheckResult]: Stem: 2777#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2752#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2753#L23-4 assume true; 2768#L23-1 assume !!(main_~i~1 < 10); 2846#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2845#L24-1 havoc main_#t~nondet5; 2844#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2769#L23-4 assume true; 2770#L23-1 assume !!(main_~i~1 < 10); 2792#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2801#L24-1 havoc main_#t~nondet5; 2773#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2774#L23-4 assume true; 2843#L23-1 assume !!(main_~i~1 < 10); 2842#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2841#L24-1 havoc main_#t~nondet5; 2840#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2839#L23-4 assume true; 2838#L23-1 assume !!(main_~i~1 < 10); 2837#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2836#L24-1 havoc main_#t~nondet5; 2835#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2834#L23-4 assume true; 2833#L23-1 assume !!(main_~i~1 < 10); 2832#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2831#L24-1 havoc main_#t~nondet5; 2830#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2829#L23-4 assume true; 2828#L23-1 assume !!(main_~i~1 < 10); 2827#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2826#L24-1 havoc main_#t~nondet5; 2825#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2824#L23-4 assume true; 2823#L23-1 assume !!(main_~i~1 < 10); 2822#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2821#L24-1 havoc main_#t~nondet5; 2820#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2819#L23-4 assume true; 2818#L23-1 assume !!(main_~i~1 < 10); 2817#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2816#L24-1 havoc main_#t~nondet5; 2815#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2814#L23-4 assume true; 2813#L23-1 assume !!(main_~i~1 < 10); 2812#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2811#L24-1 havoc main_#t~nondet5; 2810#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2809#L23-4 assume true; 2805#L23-1 assume !!(main_~i~1 < 10); 2808#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2807#L24-1 havoc main_#t~nondet5; 2806#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 2804#L23-4 assume true; 2791#L23-1 assume !(main_~i~1 < 10); 2766#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2767#L9-4 [2018-10-27 06:06:58,292 INFO L795 eck$LassoCheckResult]: Loop: 2767#L9-4 assume true; 2779#L9-1 assume !!(max_~i~0 < 10); 2757#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 2758#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2795#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2782#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 2767#L9-4 [2018-10-27 06:06:58,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash 822146989, now seen corresponding path program 10 times [2018-10-27 06:06:58,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:58,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:58,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:58,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:58,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1572732495, now seen corresponding path program 11 times [2018-10-27 06:06:58,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:58,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:58,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:58,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:58,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2090435835, now seen corresponding path program 1 times [2018-10-27 06:06:58,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:58,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:58,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:01,112 WARN L179 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 208 DAG size of output: 164 [2018-10-27 06:07:01,292 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-27 06:07:01,293 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:01,294 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:01,294 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:01,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:01,294 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:01,294 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:01,294 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:01,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:01,294 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-10-27 06:07:01,294 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:01,294 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:01,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,794 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:01,794 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:01,795 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-10-27 06:07:01,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,797 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-10-27 06:07:01,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,807 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-10-27 06:07:01,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,818 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-10-27 06:07:01,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,820 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-10-27 06:07:01,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,822 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-10-27 06:07:01,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,834 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-10-27 06:07:01,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,836 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-10-27 06:07:01,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,838 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-10-27 06:07:01,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,850 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-10-27 06:07:01,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,853 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-10-27 06:07:01,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,862 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-10-27 06:07:01,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,864 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-10-27 06:07:01,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:01,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:01,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:01,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,866 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-10-27 06:07:01,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,879 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-10-27 06:07:01,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,891 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-10-27 06:07:01,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,901 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-10-27 06:07:01,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,909 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-10-27 06:07:01,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,910 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:01,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,916 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:01,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,921 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-10-27 06:07:01,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:01,930 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-10-27 06:07:01,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:01,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:01,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:01,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:01,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:01,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:01,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:01,958 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:07:01,959 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:01,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:01,960 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:01,960 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:01,960 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2018-10-27 06:07:02,056 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:07:02,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:02,293 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-10-27 06:07:02,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 107 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-10-27 06:07:02,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 107 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 117 states and 126 transitions. Complement of second has 7 states. [2018-10-27 06:07:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:07:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:07:02,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 55 letters. Loop has 6 letters. [2018-10-27 06:07:02,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 61 letters. Loop has 6 letters. [2018-10-27 06:07:02,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 55 letters. Loop has 12 letters. [2018-10-27 06:07:02,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 126 transitions. [2018-10-27 06:07:02,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:02,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 102 states and 110 transitions. [2018-10-27 06:07:02,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-10-27 06:07:02,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-10-27 06:07:02,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 110 transitions. [2018-10-27 06:07:02,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:02,438 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-10-27 06:07:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 110 transitions. [2018-10-27 06:07:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-10-27 06:07:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-27 06:07:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-10-27 06:07:02,441 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-10-27 06:07:02,441 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-10-27 06:07:02,441 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:07:02,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 110 transitions. [2018-10-27 06:07:02,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:02,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:02,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:02,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:02,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:02,447 INFO L793 eck$LassoCheckResult]: Stem: 3214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3192#L23-4 assume true; 3204#L23-1 assume !!(main_~i~1 < 10); 3284#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3283#L24-1 havoc main_#t~nondet5; 3282#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3205#L23-4 assume true; 3206#L23-1 assume !!(main_~i~1 < 10); 3230#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3239#L24-1 havoc main_#t~nondet5; 3209#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3210#L23-4 assume true; 3281#L23-1 assume !!(main_~i~1 < 10); 3280#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3279#L24-1 havoc main_#t~nondet5; 3278#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3277#L23-4 assume true; 3276#L23-1 assume !!(main_~i~1 < 10); 3275#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3274#L24-1 havoc main_#t~nondet5; 3273#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3272#L23-4 assume true; 3271#L23-1 assume !!(main_~i~1 < 10); 3270#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3269#L24-1 havoc main_#t~nondet5; 3268#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3267#L23-4 assume true; 3266#L23-1 assume !!(main_~i~1 < 10); 3265#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3264#L24-1 havoc main_#t~nondet5; 3263#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3262#L23-4 assume true; 3261#L23-1 assume !!(main_~i~1 < 10); 3260#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3259#L24-1 havoc main_#t~nondet5; 3258#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3257#L23-4 assume true; 3256#L23-1 assume !!(main_~i~1 < 10); 3255#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3254#L24-1 havoc main_#t~nondet5; 3253#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3252#L23-4 assume true; 3251#L23-1 assume !!(main_~i~1 < 10); 3250#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3249#L24-1 havoc main_#t~nondet5; 3248#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3247#L23-4 assume true; 3243#L23-1 assume !!(main_~i~1 < 10); 3246#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3245#L24-1 havoc main_#t~nondet5; 3244#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3242#L23-4 assume true; 3229#L23-1 assume !(main_~i~1 < 10); 3202#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3203#L9-4 assume true; 3216#L9-1 assume !(max_~i~0 < 10); 3223#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3231#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 3187#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3186#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 3185#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3183#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3184#L29-4 havoc main_#t~mem8; 3197#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3195#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3196#L9-10 [2018-10-27 06:07:02,447 INFO L795 eck$LassoCheckResult]: Loop: 3196#L9-10 assume true; 3226#L9-7 assume !!(max_~i~0 < 10); 3232#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3241#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3237#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3227#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3196#L9-10 [2018-10-27 06:07:02,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 701340128, now seen corresponding path program 1 times [2018-10-27 06:07:02,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:02,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:02,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 06:07:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:02,557 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:02,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1716397297, now seen corresponding path program 1 times [2018-10-27 06:07:02,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:02,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:02,815 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:07:02,922 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:07:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:02,923 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-10-27 06:07:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:02,950 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-10-27 06:07:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:02,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 136 transitions. [2018-10-27 06:07:02,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:02,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 125 states and 135 transitions. [2018-10-27 06:07:02,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-10-27 06:07:02,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-10-27 06:07:02,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 135 transitions. [2018-10-27 06:07:02,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:02,953 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-27 06:07:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 135 transitions. [2018-10-27 06:07:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2018-10-27 06:07:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 06:07:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-10-27 06:07:02,955 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-10-27 06:07:02,955 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-10-27 06:07:02,955 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:07:02,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 111 transitions. [2018-10-27 06:07:02,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:02,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:02,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:02,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:02,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:02,957 INFO L793 eck$LassoCheckResult]: Stem: 3447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3426#L23-4 assume true; 3438#L23-1 assume !!(main_~i~1 < 10); 3464#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3474#L24-1 havoc main_#t~nondet5; 3443#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3439#L23-4 assume true; 3440#L23-1 assume !!(main_~i~1 < 10); 3520#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3519#L24-1 havoc main_#t~nondet5; 3518#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3517#L23-4 assume true; 3516#L23-1 assume !!(main_~i~1 < 10); 3515#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3514#L24-1 havoc main_#t~nondet5; 3513#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3512#L23-4 assume true; 3511#L23-1 assume !!(main_~i~1 < 10); 3510#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3509#L24-1 havoc main_#t~nondet5; 3508#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3507#L23-4 assume true; 3506#L23-1 assume !!(main_~i~1 < 10); 3505#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3504#L24-1 havoc main_#t~nondet5; 3503#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3502#L23-4 assume true; 3501#L23-1 assume !!(main_~i~1 < 10); 3500#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3499#L24-1 havoc main_#t~nondet5; 3498#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3497#L23-4 assume true; 3496#L23-1 assume !!(main_~i~1 < 10); 3495#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3494#L24-1 havoc main_#t~nondet5; 3493#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3492#L23-4 assume true; 3491#L23-1 assume !!(main_~i~1 < 10); 3490#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3489#L24-1 havoc main_#t~nondet5; 3488#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3487#L23-4 assume true; 3486#L23-1 assume !!(main_~i~1 < 10); 3485#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3484#L24-1 havoc main_#t~nondet5; 3483#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3482#L23-4 assume true; 3478#L23-1 assume !!(main_~i~1 < 10); 3481#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3480#L24-1 havoc main_#t~nondet5; 3479#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3477#L23-4 assume true; 3463#L23-1 assume !(main_~i~1 < 10); 3436#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3437#L9-4 assume true; 3448#L9-1 assume !!(max_~i~0 < 10); 3427#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3428#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3468#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3453#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3449#L9-4 assume true; 3450#L9-1 assume !(max_~i~0 < 10); 3456#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3465#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 3421#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3420#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 3419#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3417#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3418#L29-4 havoc main_#t~mem8; 3431#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3429#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3430#L9-10 assume true; 3466#L9-7 assume !!(max_~i~0 < 10); 3467#L10-6 [2018-10-27 06:07:02,957 INFO L795 eck$LassoCheckResult]: Loop: 3467#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3476#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3472#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3461#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3459#L9-10 assume true; 3460#L9-7 assume !!(max_~i~0 < 10); 3467#L10-6 [2018-10-27 06:07:02,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash 836151927, now seen corresponding path program 1 times [2018-10-27 06:07:02,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 06:07:03,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:03,107 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:03,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:03,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 06:07:03,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:03,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 06:07:03,196 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:03,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:03,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 2 times [2018-10-27 06:07:03,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:03,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,312 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:07:03,446 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:07:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:07:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:07:03,447 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-10-27 06:07:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:03,517 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-10-27 06:07:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:07:03,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 163 transitions. [2018-10-27 06:07:03,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:03,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 149 states and 162 transitions. [2018-10-27 06:07:03,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-10-27 06:07:03,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-10-27 06:07:03,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 162 transitions. [2018-10-27 06:07:03,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:03,525 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 162 transitions. [2018-10-27 06:07:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 162 transitions. [2018-10-27 06:07:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2018-10-27 06:07:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-27 06:07:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2018-10-27 06:07:03,528 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 129 transitions. [2018-10-27 06:07:03,528 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 129 transitions. [2018-10-27 06:07:03,528 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:07:03,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 129 transitions. [2018-10-27 06:07:03,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:03,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:03,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:03,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:03,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:03,541 INFO L793 eck$LassoCheckResult]: Stem: 3928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3906#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3907#L23-4 assume true; 3919#L23-1 assume !!(main_~i~1 < 10); 3946#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3957#L24-1 havoc main_#t~nondet5; 3924#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3920#L23-4 assume true; 3921#L23-1 assume !!(main_~i~1 < 10); 4017#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4016#L24-1 havoc main_#t~nondet5; 4015#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4014#L23-4 assume true; 4013#L23-1 assume !!(main_~i~1 < 10); 4012#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4011#L24-1 havoc main_#t~nondet5; 4010#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4009#L23-4 assume true; 4008#L23-1 assume !!(main_~i~1 < 10); 4007#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4006#L24-1 havoc main_#t~nondet5; 4005#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4004#L23-4 assume true; 4003#L23-1 assume !!(main_~i~1 < 10); 4002#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4001#L24-1 havoc main_#t~nondet5; 4000#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3999#L23-4 assume true; 3998#L23-1 assume !!(main_~i~1 < 10); 3997#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3996#L24-1 havoc main_#t~nondet5; 3994#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3990#L23-4 assume true; 3988#L23-1 assume !!(main_~i~1 < 10); 3987#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3986#L24-1 havoc main_#t~nondet5; 3985#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3984#L23-4 assume true; 3983#L23-1 assume !!(main_~i~1 < 10); 3982#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3981#L24-1 havoc main_#t~nondet5; 3979#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3977#L23-4 assume true; 3973#L23-1 assume !!(main_~i~1 < 10); 3971#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3970#L24-1 havoc main_#t~nondet5; 3969#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3967#L23-4 assume true; 3962#L23-1 assume !!(main_~i~1 < 10); 3966#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3964#L24-1 havoc main_#t~nondet5; 3963#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 3961#L23-4 assume true; 3945#L23-1 assume !(main_~i~1 < 10); 3917#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3918#L9-4 assume true; 3929#L9-1 assume !!(max_~i~0 < 10); 3995#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3992#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3989#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3934#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3930#L9-4 assume true; 3931#L9-1 assume !!(max_~i~0 < 10); 3908#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 3909#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3949#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3950#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3968#L9-4 assume true; 3937#L9-1 assume !(max_~i~0 < 10); 3938#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3947#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 3902#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3901#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 3900#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3898#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3899#L29-4 havoc main_#t~mem8; 3912#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3910#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 3911#L9-10 assume true; 3980#L9-7 assume !!(max_~i~0 < 10); 3978#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3975#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3972#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3943#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3941#L9-10 assume true; 3942#L9-7 assume !!(max_~i~0 < 10); 3948#L10-6 [2018-10-27 06:07:03,541 INFO L795 eck$LassoCheckResult]: Loop: 3948#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 3959#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3954#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 3955#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 3965#L9-10 assume true; 3960#L9-7 assume !!(max_~i~0 < 10); 3948#L10-6 [2018-10-27 06:07:03,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1785090121, now seen corresponding path program 1 times [2018-10-27 06:07:03,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:03,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:03,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:03,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 06:07:03,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:03,819 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:03,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 06:07:04,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:04,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-27 06:07:04,023 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:04,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 3 times [2018-10-27 06:07:04,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:04,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:04,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:04,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:04,231 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:07:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:07:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:07:04,240 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-10-27 06:07:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:04,333 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-10-27 06:07:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:07:04,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 190 transitions. [2018-10-27 06:07:04,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:04,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 173 states and 189 transitions. [2018-10-27 06:07:04,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-10-27 06:07:04,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-10-27 06:07:04,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 189 transitions. [2018-10-27 06:07:04,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:04,336 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 189 transitions. [2018-10-27 06:07:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 189 transitions. [2018-10-27 06:07:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2018-10-27 06:07:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-27 06:07:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-27 06:07:04,343 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-27 06:07:04,343 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-27 06:07:04,343 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:07:04,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 147 transitions. [2018-10-27 06:07:04,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:04,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:04,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:04,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:04,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:04,349 INFO L793 eck$LassoCheckResult]: Stem: 4486#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4465#L23-4 assume true; 4477#L23-1 assume !!(main_~i~1 < 10); 4506#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4516#L24-1 havoc main_#t~nondet5; 4482#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4478#L23-4 assume true; 4479#L23-1 assume !!(main_~i~1 < 10); 4571#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4570#L24-1 havoc main_#t~nondet5; 4569#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4568#L23-4 assume true; 4567#L23-1 assume !!(main_~i~1 < 10); 4566#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4565#L24-1 havoc main_#t~nondet5; 4564#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4563#L23-4 assume true; 4562#L23-1 assume !!(main_~i~1 < 10); 4561#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4560#L24-1 havoc main_#t~nondet5; 4559#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4558#L23-4 assume true; 4557#L23-1 assume !!(main_~i~1 < 10); 4556#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4555#L24-1 havoc main_#t~nondet5; 4554#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4553#L23-4 assume true; 4552#L23-1 assume !!(main_~i~1 < 10); 4551#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4550#L24-1 havoc main_#t~nondet5; 4549#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4548#L23-4 assume true; 4547#L23-1 assume !!(main_~i~1 < 10); 4546#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4545#L24-1 havoc main_#t~nondet5; 4544#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4543#L23-4 assume true; 4542#L23-1 assume !!(main_~i~1 < 10); 4541#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4540#L24-1 havoc main_#t~nondet5; 4539#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4538#L23-4 assume true; 4537#L23-1 assume !!(main_~i~1 < 10); 4536#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4535#L24-1 havoc main_#t~nondet5; 4533#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4531#L23-4 assume true; 4525#L23-1 assume !!(main_~i~1 < 10); 4529#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4527#L24-1 havoc main_#t~nondet5; 4526#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 4524#L23-4 assume true; 4505#L23-1 assume !(main_~i~1 < 10); 4475#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4476#L9-4 assume true; 4487#L9-1 assume !!(max_~i~0 < 10); 4466#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4467#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4509#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 4492#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4493#L9-4 assume true; 4583#L9-1 assume !!(max_~i~0 < 10); 4584#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4588#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4586#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 4585#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4488#L9-4 assume true; 4489#L9-1 assume !!(max_~i~0 < 10); 4498#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 4576#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4573#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 4534#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4532#L9-4 assume true; 4496#L9-1 assume !(max_~i~0 < 10); 4497#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4507#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 4460#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 4459#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 4458#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 4456#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 4457#L29-4 havoc main_#t~mem8; 4470#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 4468#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 4469#L9-10 assume true; 4501#L9-7 assume !!(max_~i~0 < 10); 4508#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4521#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4580#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 4502#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4503#L9-10 assume true; 4591#L9-7 assume !!(max_~i~0 < 10); 4590#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4519#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4513#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 4514#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4579#L9-10 assume true; 4578#L9-7 assume !!(max_~i~0 < 10); 4523#L10-6 [2018-10-27 06:07:04,349 INFO L795 eck$LassoCheckResult]: Loop: 4523#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 4574#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4572#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 4530#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 4528#L9-10 assume true; 4522#L9-7 assume !!(max_~i~0 < 10); 4523#L10-6 [2018-10-27 06:07:04,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1673287177, now seen corresponding path program 2 times [2018-10-27 06:07:04,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:04,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:04,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-10-27 06:07:04,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:04,484 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:07:04,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:07:04,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:04,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-10-27 06:07:04,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:04,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 06:07:04,703 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:04,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 4 times [2018-10-27 06:07:04,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:04,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:04,821 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:07:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:07:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:07:04,832 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-10-27 06:07:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:04,956 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2018-10-27 06:07:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:07:04,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 217 transitions. [2018-10-27 06:07:04,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:04,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 197 states and 216 transitions. [2018-10-27 06:07:04,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2018-10-27 06:07:04,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2018-10-27 06:07:04,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 216 transitions. [2018-10-27 06:07:04,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:04,959 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 216 transitions. [2018-10-27 06:07:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 216 transitions. [2018-10-27 06:07:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 152. [2018-10-27 06:07:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-27 06:07:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-10-27 06:07:04,964 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-10-27 06:07:04,965 INFO L608 BuchiCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-10-27 06:07:04,965 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:07:04,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 165 transitions. [2018-10-27 06:07:04,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:04,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:04,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:04,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:04,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:04,967 INFO L793 eck$LassoCheckResult]: Stem: 5120#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5096#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5097#L23-4 assume true; 5112#L23-1 assume !!(main_~i~1 < 10); 5139#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5152#L24-1 havoc main_#t~nondet5; 5117#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5113#L23-4 assume true; 5114#L23-1 assume !!(main_~i~1 < 10); 5205#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5204#L24-1 havoc main_#t~nondet5; 5203#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5202#L23-4 assume true; 5201#L23-1 assume !!(main_~i~1 < 10); 5200#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5199#L24-1 havoc main_#t~nondet5; 5198#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5197#L23-4 assume true; 5196#L23-1 assume !!(main_~i~1 < 10); 5195#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5194#L24-1 havoc main_#t~nondet5; 5193#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5192#L23-4 assume true; 5191#L23-1 assume !!(main_~i~1 < 10); 5190#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5189#L24-1 havoc main_#t~nondet5; 5188#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5187#L23-4 assume true; 5186#L23-1 assume !!(main_~i~1 < 10); 5185#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5184#L24-1 havoc main_#t~nondet5; 5183#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5182#L23-4 assume true; 5181#L23-1 assume !!(main_~i~1 < 10); 5180#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5179#L24-1 havoc main_#t~nondet5; 5178#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5177#L23-4 assume true; 5176#L23-1 assume !!(main_~i~1 < 10); 5175#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5174#L24-1 havoc main_#t~nondet5; 5173#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5172#L23-4 assume true; 5171#L23-1 assume !!(main_~i~1 < 10); 5170#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5169#L24-1 havoc main_#t~nondet5; 5167#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5164#L23-4 assume true; 5158#L23-1 assume !!(main_~i~1 < 10); 5162#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5160#L24-1 havoc main_#t~nondet5; 5159#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5157#L23-4 assume true; 5138#L23-1 assume !(main_~i~1 < 10); 5110#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5111#L9-4 assume true; 5122#L9-1 assume !!(max_~i~0 < 10); 5242#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5147#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5142#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5127#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5123#L9-4 assume true; 5124#L9-1 assume !!(max_~i~0 < 10); 5101#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5102#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5241#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5240#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5239#L9-4 assume true; 5238#L9-1 assume !!(max_~i~0 < 10); 5237#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5235#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5233#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5232#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5231#L9-4 assume true; 5166#L9-1 assume !!(max_~i~0 < 10); 5214#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5212#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5207#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5168#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5165#L9-4 assume true; 5130#L9-1 assume !(max_~i~0 < 10); 5131#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5140#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 5095#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 5094#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 5093#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 5091#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 5092#L29-4 havoc main_#t~mem8; 5105#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 5103#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5104#L9-10 assume true; 5230#L9-7 assume !!(max_~i~0 < 10); 5229#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5227#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5225#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5136#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5134#L9-10 assume true; 5135#L9-7 assume !!(max_~i~0 < 10); 5141#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5154#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5149#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5150#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5224#L9-10 assume true; 5223#L9-7 assume !!(max_~i~0 < 10); 5222#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5220#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5218#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5217#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5216#L9-10 assume true; 5215#L9-7 assume !!(max_~i~0 < 10); 5156#L10-6 [2018-10-27 06:07:04,967 INFO L795 eck$LassoCheckResult]: Loop: 5156#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5209#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5206#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5163#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5161#L9-10 assume true; 5155#L9-7 assume !!(max_~i~0 < 10); 5156#L10-6 [2018-10-27 06:07:04,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1582913847, now seen corresponding path program 3 times [2018-10-27 06:07:04,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-10-27 06:07:05,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:05,089 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:07:05,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 06:07:05,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:05,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-10-27 06:07:05,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:05,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-27 06:07:05,166 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:05,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 5 times [2018-10-27 06:07:05,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:07:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:07:05,196 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-10-27 06:07:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:05,318 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2018-10-27 06:07:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:07:05,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 244 transitions. [2018-10-27 06:07:05,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:05,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 221 states and 243 transitions. [2018-10-27 06:07:05,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2018-10-27 06:07:05,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2018-10-27 06:07:05,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 243 transitions. [2018-10-27 06:07:05,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:05,323 INFO L705 BuchiCegarLoop]: Abstraction has 221 states and 243 transitions. [2018-10-27 06:07:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 243 transitions. [2018-10-27 06:07:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2018-10-27 06:07:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-27 06:07:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2018-10-27 06:07:05,326 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 183 transitions. [2018-10-27 06:07:05,326 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 183 transitions. [2018-10-27 06:07:05,326 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-10-27 06:07:05,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 183 transitions. [2018-10-27 06:07:05,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:05,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:05,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:05,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:05,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:05,338 INFO L793 eck$LassoCheckResult]: Stem: 5833#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5812#L23-4 assume true; 5824#L23-1 assume !!(main_~i~1 < 10); 5852#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5863#L24-1 havoc main_#t~nondet5; 5829#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5825#L23-4 assume true; 5826#L23-1 assume !!(main_~i~1 < 10); 5917#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5916#L24-1 havoc main_#t~nondet5; 5915#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5914#L23-4 assume true; 5913#L23-1 assume !!(main_~i~1 < 10); 5912#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5911#L24-1 havoc main_#t~nondet5; 5910#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5909#L23-4 assume true; 5908#L23-1 assume !!(main_~i~1 < 10); 5907#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5906#L24-1 havoc main_#t~nondet5; 5905#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5904#L23-4 assume true; 5903#L23-1 assume !!(main_~i~1 < 10); 5902#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5901#L24-1 havoc main_#t~nondet5; 5900#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5899#L23-4 assume true; 5898#L23-1 assume !!(main_~i~1 < 10); 5897#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5896#L24-1 havoc main_#t~nondet5; 5895#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5894#L23-4 assume true; 5893#L23-1 assume !!(main_~i~1 < 10); 5892#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5891#L24-1 havoc main_#t~nondet5; 5890#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5889#L23-4 assume true; 5888#L23-1 assume !!(main_~i~1 < 10); 5887#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5886#L24-1 havoc main_#t~nondet5; 5885#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5884#L23-4 assume true; 5883#L23-1 assume !!(main_~i~1 < 10); 5882#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5881#L24-1 havoc main_#t~nondet5; 5879#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5876#L23-4 assume true; 5870#L23-1 assume !!(main_~i~1 < 10); 5874#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5872#L24-1 havoc main_#t~nondet5; 5871#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 5869#L23-4 assume true; 5851#L23-1 assume !(main_~i~1 < 10); 5822#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5823#L9-4 assume true; 5834#L9-1 assume !!(max_~i~0 < 10); 5813#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5814#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5858#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5966#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5835#L9-4 assume true; 5836#L9-1 assume !!(max_~i~0 < 10); 5970#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5968#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5855#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5839#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5840#L9-4 assume true; 5965#L9-1 assume !!(max_~i~0 < 10); 5964#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5962#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5960#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5959#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5958#L9-4 assume true; 5957#L9-1 assume !!(max_~i~0 < 10); 5956#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5954#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5952#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5951#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5950#L9-4 assume true; 5878#L9-1 assume !!(max_~i~0 < 10); 5926#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 5924#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5919#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5880#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5877#L9-4 assume true; 5843#L9-1 assume !(max_~i~0 < 10); 5844#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5853#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 5807#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 5806#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 5805#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 5803#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 5804#L29-4 havoc main_#t~mem8; 5817#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 5815#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 5816#L9-10 assume true; 5847#L9-7 assume !!(max_~i~0 < 10); 5854#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5866#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5945#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5848#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5849#L9-10 assume true; 5949#L9-7 assume !!(max_~i~0 < 10); 5948#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5865#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5860#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5861#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5944#L9-10 assume true; 5943#L9-7 assume !!(max_~i~0 < 10); 5942#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5940#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5938#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5937#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5936#L9-10 assume true; 5935#L9-7 assume !!(max_~i~0 < 10); 5934#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5932#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5930#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5929#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5928#L9-10 assume true; 5927#L9-7 assume !!(max_~i~0 < 10); 5868#L10-6 [2018-10-27 06:07:05,338 INFO L795 eck$LassoCheckResult]: Loop: 5868#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 5921#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5918#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 5875#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 5873#L9-10 assume true; 5867#L9-7 assume !!(max_~i~0 < 10); 5868#L10-6 [2018-10-27 06:07:05,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1190167177, now seen corresponding path program 4 times [2018-10-27 06:07:05,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-27 06:07:05,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:05,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:07:05,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:07:05,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:05,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-27 06:07:05,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:05,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:07:05,548 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:05,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 6 times [2018-10-27 06:07:05,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:07:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:07:05,589 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-10-27 06:07:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:05,889 INFO L93 Difference]: Finished difference Result 246 states and 271 transitions. [2018-10-27 06:07:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:07:05,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 271 transitions. [2018-10-27 06:07:05,891 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:05,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 245 states and 270 transitions. [2018-10-27 06:07:05,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2018-10-27 06:07:05,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-10-27 06:07:05,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 270 transitions. [2018-10-27 06:07:05,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:05,893 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 270 transitions. [2018-10-27 06:07:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 270 transitions. [2018-10-27 06:07:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 184. [2018-10-27 06:07:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-27 06:07:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2018-10-27 06:07:05,897 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 201 transitions. [2018-10-27 06:07:05,897 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 201 transitions. [2018-10-27 06:07:05,897 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-10-27 06:07:05,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 201 transitions. [2018-10-27 06:07:05,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:05,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:05,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:05,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:05,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:05,907 INFO L793 eck$LassoCheckResult]: Stem: 6621#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 6598#L23-4 assume true; 6613#L23-1 assume !!(main_~i~1 < 10); 6642#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6653#L24-1 havoc main_#t~nondet5; 6618#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6614#L23-4 assume true; 6615#L23-1 assume !!(main_~i~1 < 10); 6707#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6706#L24-1 havoc main_#t~nondet5; 6705#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6704#L23-4 assume true; 6703#L23-1 assume !!(main_~i~1 < 10); 6702#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6701#L24-1 havoc main_#t~nondet5; 6700#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6699#L23-4 assume true; 6698#L23-1 assume !!(main_~i~1 < 10); 6697#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6696#L24-1 havoc main_#t~nondet5; 6695#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6694#L23-4 assume true; 6693#L23-1 assume !!(main_~i~1 < 10); 6692#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6691#L24-1 havoc main_#t~nondet5; 6690#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6689#L23-4 assume true; 6688#L23-1 assume !!(main_~i~1 < 10); 6687#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6686#L24-1 havoc main_#t~nondet5; 6685#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6684#L23-4 assume true; 6683#L23-1 assume !!(main_~i~1 < 10); 6682#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6681#L24-1 havoc main_#t~nondet5; 6680#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6679#L23-4 assume true; 6678#L23-1 assume !!(main_~i~1 < 10); 6677#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6676#L24-1 havoc main_#t~nondet5; 6675#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6674#L23-4 assume true; 6673#L23-1 assume !!(main_~i~1 < 10); 6672#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6671#L24-1 havoc main_#t~nondet5; 6669#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6666#L23-4 assume true; 6660#L23-1 assume !!(main_~i~1 < 10); 6664#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6662#L24-1 havoc main_#t~nondet5; 6661#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 6659#L23-4 assume true; 6641#L23-1 assume !(main_~i~1 < 10); 6611#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6612#L9-4 assume true; 6623#L9-1 assume !!(max_~i~0 < 10); 6634#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 6775#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6774#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6773#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6624#L9-4 assume true; 6625#L9-1 assume !!(max_~i~0 < 10); 6602#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 6603#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6645#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6628#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6629#L9-4 assume true; 6772#L9-1 assume !!(max_~i~0 < 10); 6771#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 6769#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6767#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6766#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6765#L9-4 assume true; 6764#L9-1 assume !!(max_~i~0 < 10); 6763#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 6761#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6759#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6758#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6757#L9-4 assume true; 6756#L9-1 assume !!(max_~i~0 < 10); 6755#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 6753#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6750#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6748#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6745#L9-4 assume true; 6668#L9-1 assume !!(max_~i~0 < 10); 6716#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 6714#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6709#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6670#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6667#L9-4 assume true; 6632#L9-1 assume !(max_~i~0 < 10); 6633#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 6643#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 6596#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 6595#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 6594#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 6592#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 6593#L29-4 havoc main_#t~mem8; 6606#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 6604#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6605#L9-10 assume true; 6751#L9-7 assume !!(max_~i~0 < 10); 6749#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 6655#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6651#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6639#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6637#L9-10 assume true; 6638#L9-7 assume !!(max_~i~0 < 10); 6644#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 6656#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6744#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6743#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6742#L9-10 assume true; 6741#L9-7 assume !!(max_~i~0 < 10); 6740#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 6738#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6736#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6735#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6734#L9-10 assume true; 6733#L9-7 assume !!(max_~i~0 < 10); 6732#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 6730#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6728#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6727#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6726#L9-10 assume true; 6725#L9-7 assume !!(max_~i~0 < 10); 6724#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 6722#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6720#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6719#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6718#L9-10 assume true; 6717#L9-7 assume !!(max_~i~0 < 10); 6658#L10-6 [2018-10-27 06:07:05,907 INFO L795 eck$LassoCheckResult]: Loop: 6658#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 6711#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6708#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 6665#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 6663#L9-10 assume true; 6657#L9-7 assume !!(max_~i~0 < 10); 6658#L10-6 [2018-10-27 06:07:05,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 709547703, now seen corresponding path program 5 times [2018-10-27 06:07:05,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-10-27 06:07:06,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:06,570 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:06,593 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:07:06,650 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-10-27 06:07:06,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:06,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-10-27 06:07:06,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:06,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-27 06:07:06,701 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:06,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 7 times [2018-10-27 06:07:06,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:06,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:06,737 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. cyclomatic complexity: 22 Second operand 10 states. [2018-10-27 06:07:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:06,874 INFO L93 Difference]: Finished difference Result 270 states and 298 transitions. [2018-10-27 06:07:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:06,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 298 transitions. [2018-10-27 06:07:06,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:06,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 269 states and 297 transitions. [2018-10-27 06:07:06,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-10-27 06:07:06,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2018-10-27 06:07:06,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 297 transitions. [2018-10-27 06:07:06,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:06,878 INFO L705 BuchiCegarLoop]: Abstraction has 269 states and 297 transitions. [2018-10-27 06:07:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 297 transitions. [2018-10-27 06:07:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 200. [2018-10-27 06:07:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-27 06:07:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2018-10-27 06:07:06,881 INFO L728 BuchiCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-10-27 06:07:06,881 INFO L608 BuchiCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-10-27 06:07:06,881 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-10-27 06:07:06,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 219 transitions. [2018-10-27 06:07:06,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:06,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:06,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:06,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,892 INFO L793 eck$LassoCheckResult]: Stem: 7487#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7463#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 7464#L23-4 assume true; 7479#L23-1 assume !!(main_~i~1 < 10); 7508#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7519#L24-1 havoc main_#t~nondet5; 7484#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7480#L23-4 assume true; 7481#L23-1 assume !!(main_~i~1 < 10); 7573#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7572#L24-1 havoc main_#t~nondet5; 7571#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7570#L23-4 assume true; 7569#L23-1 assume !!(main_~i~1 < 10); 7568#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7567#L24-1 havoc main_#t~nondet5; 7566#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7565#L23-4 assume true; 7564#L23-1 assume !!(main_~i~1 < 10); 7563#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7562#L24-1 havoc main_#t~nondet5; 7561#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7560#L23-4 assume true; 7559#L23-1 assume !!(main_~i~1 < 10); 7558#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7557#L24-1 havoc main_#t~nondet5; 7556#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7555#L23-4 assume true; 7554#L23-1 assume !!(main_~i~1 < 10); 7553#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7552#L24-1 havoc main_#t~nondet5; 7551#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7550#L23-4 assume true; 7549#L23-1 assume !!(main_~i~1 < 10); 7548#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7547#L24-1 havoc main_#t~nondet5; 7546#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7545#L23-4 assume true; 7544#L23-1 assume !!(main_~i~1 < 10); 7543#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7542#L24-1 havoc main_#t~nondet5; 7541#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7540#L23-4 assume true; 7539#L23-1 assume !!(main_~i~1 < 10); 7538#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7537#L24-1 havoc main_#t~nondet5; 7535#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7532#L23-4 assume true; 7526#L23-1 assume !!(main_~i~1 < 10); 7530#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7528#L24-1 havoc main_#t~nondet5; 7527#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 7525#L23-4 assume true; 7507#L23-1 assume !(main_~i~1 < 10); 7477#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 7478#L9-4 assume true; 7489#L9-1 assume !!(max_~i~0 < 10); 7500#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7657#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7656#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7655#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7490#L9-4 assume true; 7491#L9-1 assume !!(max_~i~0 < 10); 7468#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7469#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7511#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7494#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7495#L9-4 assume true; 7654#L9-1 assume !!(max_~i~0 < 10); 7653#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7651#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7649#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7648#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7647#L9-4 assume true; 7646#L9-1 assume !!(max_~i~0 < 10); 7645#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7643#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7641#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7640#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7639#L9-4 assume true; 7638#L9-1 assume !!(max_~i~0 < 10); 7637#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7635#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7633#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7632#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7631#L9-4 assume true; 7630#L9-1 assume !!(max_~i~0 < 10); 7629#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7627#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7624#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7622#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7619#L9-4 assume true; 7534#L9-1 assume !!(max_~i~0 < 10); 7582#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 7580#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7575#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7536#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7533#L9-4 assume true; 7498#L9-1 assume !(max_~i~0 < 10); 7499#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 7509#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 7462#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 7461#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 7460#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 7458#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 7459#L29-4 havoc main_#t~mem8; 7472#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 7470#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 7471#L9-10 assume true; 7625#L9-7 assume !!(max_~i~0 < 10); 7623#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7521#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7517#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7505#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7503#L9-10 assume true; 7504#L9-7 assume !!(max_~i~0 < 10); 7510#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7522#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7618#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7617#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7616#L9-10 assume true; 7615#L9-7 assume !!(max_~i~0 < 10); 7614#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7612#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7610#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7609#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7608#L9-10 assume true; 7607#L9-7 assume !!(max_~i~0 < 10); 7606#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7604#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7602#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7601#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7600#L9-10 assume true; 7599#L9-7 assume !!(max_~i~0 < 10); 7598#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7596#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7594#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7593#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7592#L9-10 assume true; 7591#L9-7 assume !!(max_~i~0 < 10); 7590#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7588#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7586#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7585#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7584#L9-10 assume true; 7583#L9-7 assume !!(max_~i~0 < 10); 7524#L10-6 [2018-10-27 06:07:06,892 INFO L795 eck$LassoCheckResult]: Loop: 7524#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 7577#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7574#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7531#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 7529#L9-10 assume true; 7523#L9-7 assume !!(max_~i~0 < 10); 7524#L10-6 [2018-10-27 06:07:06,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1398790921, now seen corresponding path program 6 times [2018-10-27 06:07:06,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:06,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-10-27 06:07:07,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:07,085 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:07:07,253 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-10-27 06:07:07,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:07,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-10-27 06:07:07,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 06:07:07,291 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:07,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 8 times [2018-10-27 06:07:07,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:07,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:07:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:07:07,392 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. cyclomatic complexity: 24 Second operand 11 states. [2018-10-27 06:07:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:07,517 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2018-10-27 06:07:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:07:07,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 325 transitions. [2018-10-27 06:07:07,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:07,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 293 states and 324 transitions. [2018-10-27 06:07:07,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2018-10-27 06:07:07,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2018-10-27 06:07:07,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 324 transitions. [2018-10-27 06:07:07,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:07,522 INFO L705 BuchiCegarLoop]: Abstraction has 293 states and 324 transitions. [2018-10-27 06:07:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 324 transitions. [2018-10-27 06:07:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 216. [2018-10-27 06:07:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-27 06:07:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2018-10-27 06:07:07,526 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 237 transitions. [2018-10-27 06:07:07,526 INFO L608 BuchiCegarLoop]: Abstraction has 216 states and 237 transitions. [2018-10-27 06:07:07,526 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-10-27 06:07:07,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 237 transitions. [2018-10-27 06:07:07,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:07,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:07,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:07,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,536 INFO L793 eck$LassoCheckResult]: Stem: 8431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8409#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 8410#L23-4 assume true; 8422#L23-1 assume !!(main_~i~1 < 10); 8450#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8461#L24-1 havoc main_#t~nondet5; 8427#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8423#L23-4 assume true; 8424#L23-1 assume !!(main_~i~1 < 10); 8514#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8513#L24-1 havoc main_#t~nondet5; 8512#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8511#L23-4 assume true; 8510#L23-1 assume !!(main_~i~1 < 10); 8509#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8508#L24-1 havoc main_#t~nondet5; 8507#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8506#L23-4 assume true; 8505#L23-1 assume !!(main_~i~1 < 10); 8504#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8503#L24-1 havoc main_#t~nondet5; 8502#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8501#L23-4 assume true; 8500#L23-1 assume !!(main_~i~1 < 10); 8499#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8498#L24-1 havoc main_#t~nondet5; 8497#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8496#L23-4 assume true; 8495#L23-1 assume !!(main_~i~1 < 10); 8494#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8493#L24-1 havoc main_#t~nondet5; 8492#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8491#L23-4 assume true; 8490#L23-1 assume !!(main_~i~1 < 10); 8489#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8488#L24-1 havoc main_#t~nondet5; 8487#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8486#L23-4 assume true; 8485#L23-1 assume !!(main_~i~1 < 10); 8484#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8483#L24-1 havoc main_#t~nondet5; 8482#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8481#L23-4 assume true; 8480#L23-1 assume !!(main_~i~1 < 10); 8479#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8478#L24-1 havoc main_#t~nondet5; 8476#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8473#L23-4 assume true; 8467#L23-1 assume !!(main_~i~1 < 10); 8471#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8469#L24-1 havoc main_#t~nondet5; 8468#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 8466#L23-4 assume true; 8449#L23-1 assume !(main_~i~1 < 10); 8420#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 8421#L9-4 assume true; 8432#L9-1 assume !!(max_~i~0 < 10); 8411#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8412#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8612#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8433#L9-4 assume true; 8434#L9-1 assume !!(max_~i~0 < 10); 8616#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8614#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8453#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8437#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8438#L9-4 assume true; 8611#L9-1 assume !!(max_~i~0 < 10); 8610#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8608#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8606#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8605#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8604#L9-4 assume true; 8603#L9-1 assume !!(max_~i~0 < 10); 8602#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8600#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8598#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8597#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8596#L9-4 assume true; 8595#L9-1 assume !!(max_~i~0 < 10); 8594#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8592#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8590#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8589#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8588#L9-4 assume true; 8587#L9-1 assume !!(max_~i~0 < 10); 8586#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8584#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8582#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8581#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8580#L9-4 assume true; 8579#L9-1 assume !!(max_~i~0 < 10); 8578#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8576#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8574#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8573#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8572#L9-4 assume true; 8475#L9-1 assume !!(max_~i~0 < 10); 8523#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 8521#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8516#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8477#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8474#L9-4 assume true; 8441#L9-1 assume !(max_~i~0 < 10); 8442#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 8451#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 8405#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 8404#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 8403#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 8401#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 8402#L29-4 havoc main_#t~mem8; 8415#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 8413#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 8414#L9-10 assume true; 8571#L9-7 assume !!(max_~i~0 < 10); 8570#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8568#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8458#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8447#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8445#L9-10 assume true; 8446#L9-7 assume !!(max_~i~0 < 10); 8452#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8463#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8460#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8566#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8565#L9-10 assume true; 8564#L9-7 assume !!(max_~i~0 < 10); 8563#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8561#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8559#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8558#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8557#L9-10 assume true; 8556#L9-7 assume !!(max_~i~0 < 10); 8555#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8553#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8551#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8550#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8549#L9-10 assume true; 8548#L9-7 assume !!(max_~i~0 < 10); 8547#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8545#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8543#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8542#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8541#L9-10 assume true; 8540#L9-7 assume !!(max_~i~0 < 10); 8539#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8537#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8535#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8534#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8533#L9-10 assume true; 8532#L9-7 assume !!(max_~i~0 < 10); 8531#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8529#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8527#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8526#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8525#L9-10 assume true; 8524#L9-7 assume !!(max_~i~0 < 10); 8465#L10-6 [2018-10-27 06:07:07,536 INFO L795 eck$LassoCheckResult]: Loop: 8465#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 8518#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 8515#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 8472#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 8470#L9-10 assume true; 8464#L9-7 assume !!(max_~i~0 < 10); 8465#L10-6 [2018-10-27 06:07:07,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1823201225, now seen corresponding path program 7 times [2018-10-27 06:07:07,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-27 06:07:07,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:07,810 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:07,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:07,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-27 06:07:07,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:07,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-10-27 06:07:07,955 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:07,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 9 times [2018-10-27 06:07:07,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:07:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:07:08,040 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. cyclomatic complexity: 26 Second operand 12 states. [2018-10-27 06:07:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,174 INFO L93 Difference]: Finished difference Result 318 states and 352 transitions. [2018-10-27 06:07:08,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:07:08,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 352 transitions. [2018-10-27 06:07:08,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:08,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 317 states and 351 transitions. [2018-10-27 06:07:08,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2018-10-27 06:07:08,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-10-27 06:07:08,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 351 transitions. [2018-10-27 06:07:08,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:08,179 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 351 transitions. [2018-10-27 06:07:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 351 transitions. [2018-10-27 06:07:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 232. [2018-10-27 06:07:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-27 06:07:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 255 transitions. [2018-10-27 06:07:08,188 INFO L728 BuchiCegarLoop]: Abstraction has 232 states and 255 transitions. [2018-10-27 06:07:08,188 INFO L608 BuchiCegarLoop]: Abstraction has 232 states and 255 transitions. [2018-10-27 06:07:08,190 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-10-27 06:07:08,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 255 transitions. [2018-10-27 06:07:08,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:08,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,193 INFO L793 eck$LassoCheckResult]: Stem: 9451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9430#L23-4 assume true; 9442#L23-1 assume !!(main_~i~1 < 10); 9469#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9481#L24-1 havoc main_#t~nondet5; 9447#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9443#L23-4 assume true; 9444#L23-1 assume !!(main_~i~1 < 10); 9534#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9533#L24-1 havoc main_#t~nondet5; 9532#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9531#L23-4 assume true; 9530#L23-1 assume !!(main_~i~1 < 10); 9529#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9528#L24-1 havoc main_#t~nondet5; 9527#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9526#L23-4 assume true; 9525#L23-1 assume !!(main_~i~1 < 10); 9524#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9523#L24-1 havoc main_#t~nondet5; 9522#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9521#L23-4 assume true; 9520#L23-1 assume !!(main_~i~1 < 10); 9519#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9518#L24-1 havoc main_#t~nondet5; 9517#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9516#L23-4 assume true; 9515#L23-1 assume !!(main_~i~1 < 10); 9514#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9513#L24-1 havoc main_#t~nondet5; 9512#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9511#L23-4 assume true; 9510#L23-1 assume !!(main_~i~1 < 10); 9509#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9508#L24-1 havoc main_#t~nondet5; 9507#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9506#L23-4 assume true; 9505#L23-1 assume !!(main_~i~1 < 10); 9504#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9503#L24-1 havoc main_#t~nondet5; 9502#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9501#L23-4 assume true; 9500#L23-1 assume !!(main_~i~1 < 10); 9499#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9498#L24-1 havoc main_#t~nondet5; 9496#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9493#L23-4 assume true; 9487#L23-1 assume !!(main_~i~1 < 10); 9491#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9489#L24-1 havoc main_#t~nondet5; 9488#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 9486#L23-4 assume true; 9468#L23-1 assume !(main_~i~1 < 10); 9440#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 9441#L9-4 assume true; 9452#L9-1 assume !!(max_~i~0 < 10); 9431#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9432#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9472#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9457#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9453#L9-4 assume true; 9454#L9-1 assume !!(max_~i~0 < 10); 9652#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9651#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9650#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9649#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9648#L9-4 assume true; 9647#L9-1 assume !!(max_~i~0 < 10); 9646#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9644#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9642#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9641#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9640#L9-4 assume true; 9639#L9-1 assume !!(max_~i~0 < 10); 9638#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9636#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9634#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9633#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9632#L9-4 assume true; 9631#L9-1 assume !!(max_~i~0 < 10); 9630#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9628#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9626#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9625#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9624#L9-4 assume true; 9623#L9-1 assume !!(max_~i~0 < 10); 9622#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9620#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9618#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9617#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9616#L9-4 assume true; 9615#L9-1 assume !!(max_~i~0 < 10); 9614#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9612#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9610#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9609#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9608#L9-4 assume true; 9607#L9-1 assume !!(max_~i~0 < 10); 9606#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9604#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9602#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9601#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9600#L9-4 assume true; 9495#L9-1 assume !!(max_~i~0 < 10); 9543#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 9541#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9536#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9497#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9494#L9-4 assume true; 9460#L9-1 assume !(max_~i~0 < 10); 9461#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 9470#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 9425#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 9424#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 9423#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 9421#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 9422#L29-4 havoc main_#t~mem8; 9435#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 9433#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 9434#L9-10 assume true; 9599#L9-7 assume !!(max_~i~0 < 10); 9598#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9596#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9594#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9466#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9464#L9-10 assume true; 9465#L9-7 assume !!(max_~i~0 < 10); 9471#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9483#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9478#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9479#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9593#L9-10 assume true; 9592#L9-7 assume !!(max_~i~0 < 10); 9591#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9589#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9587#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9586#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9585#L9-10 assume true; 9584#L9-7 assume !!(max_~i~0 < 10); 9583#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9581#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9579#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9578#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9577#L9-10 assume true; 9576#L9-7 assume !!(max_~i~0 < 10); 9575#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9573#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9571#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9570#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9569#L9-10 assume true; 9568#L9-7 assume !!(max_~i~0 < 10); 9567#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9565#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9563#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9562#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9561#L9-10 assume true; 9560#L9-7 assume !!(max_~i~0 < 10); 9559#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9557#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9555#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9554#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9553#L9-10 assume true; 9552#L9-7 assume !!(max_~i~0 < 10); 9551#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9549#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9547#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9546#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9545#L9-10 assume true; 9544#L9-7 assume !!(max_~i~0 < 10); 9485#L10-6 [2018-10-27 06:07:08,193 INFO L795 eck$LassoCheckResult]: Loop: 9485#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 9538#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 9535#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 9492#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 9490#L9-10 assume true; 9484#L9-7 assume !!(max_~i~0 < 10); 9485#L10-6 [2018-10-27 06:07:08,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1717280887, now seen corresponding path program 8 times [2018-10-27 06:07:08,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-10-27 06:07:08,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:08,545 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:08,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:07:08,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:07:08,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:08,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-10-27 06:07:08,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:08,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 06:07:08,667 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:08,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 10 times [2018-10-27 06:07:08,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:07:08,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:07:08,779 INFO L87 Difference]: Start difference. First operand 232 states and 255 transitions. cyclomatic complexity: 28 Second operand 13 states. [2018-10-27 06:07:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,931 INFO L93 Difference]: Finished difference Result 324 states and 358 transitions. [2018-10-27 06:07:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:07:08,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 358 transitions. [2018-10-27 06:07:08,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:08,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 323 states and 357 transitions. [2018-10-27 06:07:08,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2018-10-27 06:07:08,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-10-27 06:07:08,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 323 states and 357 transitions. [2018-10-27 06:07:08,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:08,935 INFO L705 BuchiCegarLoop]: Abstraction has 323 states and 357 transitions. [2018-10-27 06:07:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states and 357 transitions. [2018-10-27 06:07:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 248. [2018-10-27 06:07:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-27 06:07:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 273 transitions. [2018-10-27 06:07:08,943 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 273 transitions. [2018-10-27 06:07:08,944 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 273 transitions. [2018-10-27 06:07:08,944 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-10-27 06:07:08,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 273 transitions. [2018-10-27 06:07:08,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:07:08,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,946 INFO L793 eck$LassoCheckResult]: Stem: 10530#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10508#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 10509#L23-4 assume true; 10521#L23-1 assume !!(main_~i~1 < 10); 10663#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10561#L24-1 havoc main_#t~nondet5; 10526#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10522#L23-4 assume true; 10523#L23-1 assume !!(main_~i~1 < 10); 10548#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10563#L24-1 havoc main_#t~nondet5; 10658#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10656#L23-4 assume true; 10654#L23-1 assume !!(main_~i~1 < 10); 10652#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10650#L24-1 havoc main_#t~nondet5; 10648#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10644#L23-4 assume true; 10642#L23-1 assume !!(main_~i~1 < 10); 10640#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10638#L24-1 havoc main_#t~nondet5; 10636#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10634#L23-4 assume true; 10630#L23-1 assume !!(main_~i~1 < 10); 10628#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10626#L24-1 havoc main_#t~nondet5; 10624#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10622#L23-4 assume true; 10620#L23-1 assume !!(main_~i~1 < 10); 10616#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10614#L24-1 havoc main_#t~nondet5; 10612#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10610#L23-4 assume true; 10608#L23-1 assume !!(main_~i~1 < 10); 10606#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10602#L24-1 havoc main_#t~nondet5; 10600#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10598#L23-4 assume true; 10596#L23-1 assume !!(main_~i~1 < 10); 10594#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10592#L24-1 havoc main_#t~nondet5; 10588#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10586#L23-4 assume true; 10584#L23-1 assume !!(main_~i~1 < 10); 10582#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10580#L24-1 havoc main_#t~nondet5; 10579#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10575#L23-4 assume true; 10568#L23-1 assume !!(main_~i~1 < 10); 10572#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10570#L24-1 havoc main_#t~nondet5; 10569#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 10567#L23-4 assume true; 10547#L23-1 assume !(main_~i~1 < 10); 10519#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 10520#L9-4 assume true; 10531#L9-1 assume !!(max_~i~0 < 10); 10747#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10556#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10551#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10536#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10532#L9-4 assume true; 10533#L9-1 assume !!(max_~i~0 < 10); 10510#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10511#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10746#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10745#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10744#L9-4 assume true; 10743#L9-1 assume !!(max_~i~0 < 10); 10742#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10740#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10738#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10737#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10736#L9-4 assume true; 10735#L9-1 assume !!(max_~i~0 < 10); 10734#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10732#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10730#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10729#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10728#L9-4 assume true; 10727#L9-1 assume !!(max_~i~0 < 10); 10726#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10724#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10722#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10721#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10720#L9-4 assume true; 10719#L9-1 assume !!(max_~i~0 < 10); 10718#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10716#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10714#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10713#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10712#L9-4 assume true; 10711#L9-1 assume !!(max_~i~0 < 10); 10710#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10708#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10706#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10705#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10704#L9-4 assume true; 10703#L9-1 assume !!(max_~i~0 < 10); 10702#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10700#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10698#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10697#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10696#L9-4 assume true; 10695#L9-1 assume !!(max_~i~0 < 10); 10694#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10692#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10690#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10689#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10688#L9-4 assume true; 10675#L9-1 assume !!(max_~i~0 < 10); 10687#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 10684#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10681#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10677#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10674#L9-4 assume true; 10539#L9-1 assume !(max_~i~0 < 10); 10540#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 10549#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 10504#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 10503#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 10502#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 10500#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 10501#L29-4 havoc main_#t~mem8; 10514#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 10512#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 10513#L9-10 assume true; 10686#L9-7 assume !!(max_~i~0 < 10); 10682#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10679#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10676#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10545#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10543#L9-10 assume true; 10544#L9-7 assume !!(max_~i~0 < 10); 10550#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10564#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10558#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10559#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10673#L9-10 assume true; 10672#L9-7 assume !!(max_~i~0 < 10); 10671#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10669#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10667#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10666#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10665#L9-10 assume true; 10664#L9-7 assume !!(max_~i~0 < 10); 10662#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10660#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10657#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10655#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10653#L9-10 assume true; 10651#L9-7 assume !!(max_~i~0 < 10); 10649#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10646#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10643#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10641#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10639#L9-10 assume true; 10637#L9-7 assume !!(max_~i~0 < 10); 10635#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10632#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10629#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10627#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10625#L9-10 assume true; 10623#L9-7 assume !!(max_~i~0 < 10); 10621#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10618#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10615#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10613#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10611#L9-10 assume true; 10609#L9-7 assume !!(max_~i~0 < 10); 10607#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10604#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10601#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10599#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10597#L9-10 assume true; 10595#L9-7 assume !!(max_~i~0 < 10); 10593#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10590#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10587#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10585#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10583#L9-10 assume true; 10581#L9-7 assume !!(max_~i~0 < 10); 10566#L10-6 [2018-10-27 06:07:08,946 INFO L795 eck$LassoCheckResult]: Loop: 10566#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 10577#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 10574#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 10573#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 10571#L9-10 assume true; 10565#L9-7 assume !!(max_~i~0 < 10); 10566#L10-6 [2018-10-27 06:07:08,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1101312585, now seen corresponding path program 9 times [2018-10-27 06:07:08,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962737, now seen corresponding path program 11 times [2018-10-27 06:07:09,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash -838894459, now seen corresponding path program 10 times [2018-10-27 06:07:09,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 243 proven. 47 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-10-27 06:07:10,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:10,360 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_595967f8-5cae-425f-b9f4-51015561fc3b/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:07:10,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:07:10,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:07:10,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-10-27 06:07:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:07:10,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2018-10-27 06:07:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 06:07:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=388, Unknown=0, NotChecked=0, Total=600 [2018-10-27 06:07:10,612 INFO L87 Difference]: Start difference. First operand 248 states and 273 transitions. cyclomatic complexity: 30 Second operand 25 states. [2018-10-27 06:07:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:11,168 INFO L93 Difference]: Finished difference Result 323 states and 354 transitions. [2018-10-27 06:07:11,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:07:11,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 354 transitions. [2018-10-27 06:07:11,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:07:11,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 238 states and 259 transitions. [2018-10-27 06:07:11,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2018-10-27 06:07:11,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-10-27 06:07:11,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 259 transitions. [2018-10-27 06:07:11,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:11,173 INFO L705 BuchiCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-10-27 06:07:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 259 transitions. [2018-10-27 06:07:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-27 06:07:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-27 06:07:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 259 transitions. [2018-10-27 06:07:11,176 INFO L728 BuchiCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-10-27 06:07:11,176 INFO L608 BuchiCegarLoop]: Abstraction has 238 states and 259 transitions. [2018-10-27 06:07:11,176 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-10-27 06:07:11,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 238 states and 259 transitions. [2018-10-27 06:07:11,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:07:11,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:11,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:11,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,191 INFO L793 eck$LassoCheckResult]: Stem: 11739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 11707#L23-4 assume true; 11731#L23-1 assume !!(main_~i~1 < 10); 11932#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11931#L24-1 havoc main_#t~nondet5; 11930#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11732#L23-4 assume true; 11719#L23-1 assume !!(main_~i~1 < 10); 11720#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11742#L24-1 havoc main_#t~nondet5; 11735#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11736#L23-4 assume true; 11929#L23-1 assume !!(main_~i~1 < 10); 11928#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11927#L24-1 havoc main_#t~nondet5; 11926#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11925#L23-4 assume true; 11924#L23-1 assume !!(main_~i~1 < 10); 11923#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11922#L24-1 havoc main_#t~nondet5; 11921#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11920#L23-4 assume true; 11919#L23-1 assume !!(main_~i~1 < 10); 11918#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11917#L24-1 havoc main_#t~nondet5; 11916#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11915#L23-4 assume true; 11914#L23-1 assume !!(main_~i~1 < 10); 11913#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11912#L24-1 havoc main_#t~nondet5; 11911#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11910#L23-4 assume true; 11909#L23-1 assume !!(main_~i~1 < 10); 11908#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11907#L24-1 havoc main_#t~nondet5; 11906#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11905#L23-4 assume true; 11904#L23-1 assume !!(main_~i~1 < 10); 11903#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11902#L24-1 havoc main_#t~nondet5; 11901#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11900#L23-4 assume true; 11899#L23-1 assume !!(main_~i~1 < 10); 11898#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11897#L24-1 havoc main_#t~nondet5; 11896#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11895#L23-4 assume true; 11891#L23-1 assume !!(main_~i~1 < 10); 11894#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 11893#L24-1 havoc main_#t~nondet5; 11892#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 11890#L23-4 assume true; 11717#L23-1 assume !(main_~i~1 < 10); 11718#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 11728#L9-4 assume true; 11888#L9-1 assume !!(max_~i~0 < 10); 11887#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11734#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11726#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11700#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11697#L9-4 assume true; 11698#L9-1 assume !!(max_~i~0 < 10); 11703#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11712#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11881#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11879#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11877#L9-4 assume true; 11875#L9-1 assume !!(max_~i~0 < 10); 11873#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11868#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11865#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11863#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11861#L9-4 assume true; 11859#L9-1 assume !!(max_~i~0 < 10); 11857#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11852#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11849#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11847#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11845#L9-4 assume true; 11843#L9-1 assume !!(max_~i~0 < 10); 11841#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11836#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11833#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11831#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11829#L9-4 assume true; 11827#L9-1 assume !!(max_~i~0 < 10); 11825#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11820#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11817#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11815#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11813#L9-4 assume true; 11811#L9-1 assume !!(max_~i~0 < 10); 11809#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11804#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11801#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11799#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11797#L9-4 assume true; 11795#L9-1 assume !!(max_~i~0 < 10); 11793#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11788#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11785#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11783#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11781#L9-4 assume true; 11779#L9-1 assume !!(max_~i~0 < 10); 11777#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11772#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11769#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11767#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11765#L9-4 assume true; 11763#L9-1 assume !!(max_~i~0 < 10); 11761#L10 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10 11756#L10-1 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11753#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11751#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11749#L9-4 assume true; 11747#L9-1 assume !(max_~i~0 < 10); 11725#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 11721#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6; 11702#L29 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 11701#L29-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7; 11699#L29-2 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 11695#L29-3 SUMMARY for call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 11696#L29-4 havoc main_#t~mem8; 11724#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 11722#L29-6 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 11708#L9-10 assume true; 11709#L9-7 assume !!(max_~i~0 < 10); 11723#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11744#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11737#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11713#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11714#L9-10 assume true; 11889#L9-7 assume !!(max_~i~0 < 10); 11745#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11746#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11882#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11880#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11878#L9-10 assume true; 11876#L9-7 assume !!(max_~i~0 < 10); 11874#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11871#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11866#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11864#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11862#L9-10 assume true; 11860#L9-7 assume !!(max_~i~0 < 10); 11858#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11855#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11850#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11848#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11846#L9-10 assume true; 11844#L9-7 assume !!(max_~i~0 < 10); 11842#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11839#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11834#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11832#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11830#L9-10 assume true; 11828#L9-7 assume !!(max_~i~0 < 10); 11826#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11823#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11818#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11816#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11814#L9-10 assume true; 11812#L9-7 assume !!(max_~i~0 < 10); 11810#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11807#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11802#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11800#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11798#L9-10 assume true; 11796#L9-7 assume !!(max_~i~0 < 10); 11794#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11791#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11786#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11784#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11782#L9-10 assume true; 11780#L9-7 assume !!(max_~i~0 < 10); 11778#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11775#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11770#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11768#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11766#L9-10 assume true; 11764#L9-7 assume !!(max_~i~0 < 10); 11762#L10-6 SUMMARY for call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + max_~i~0 * 4, 4); srcloc: L10-6 11759#L10-7 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 11754#L10-11 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 11752#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := max_#t~post0 + 1;havoc max_#t~post0; 11750#L9-10 assume true; 11748#L9-7 assume !(max_~i~0 < 10); 11733#L9-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 11715#L12-1 main_#t~ret9 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9; 11716#L31 SUMMARY for call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 11704#L31-1 main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 11705#L32-4 [2018-10-27 06:07:11,191 INFO L795 eck$LassoCheckResult]: Loop: 11705#L32-4 assume true; 11710#L32-1 assume !!(main_~i~2 < 9); 11711#L33 SUMMARY for call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L33 11740#L33-1 SUMMARY for call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L33-1 11738#L33-2 havoc main_#t~mem12; 11729#L32-3 main_#t~post11 := main_~i~2;main_~i~2 := main_#t~post11 + 1;havoc main_#t~post11; 11705#L32-4 [2018-10-27 06:07:11,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1858326938, now seen corresponding path program 1 times [2018-10-27 06:07:11,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash -858483063, now seen corresponding path program 1 times [2018-10-27 06:07:11,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144466, now seen corresponding path program 1 times [2018-10-27 06:07:11,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:11,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,215 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-27 06:07:26,526 WARN L179 SmtUtils]: Spent 14.26 s on a formula simplification. DAG size of input: 644 DAG size of output: 491 [2018-10-27 06:07:28,012 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 171 DAG size of output: 163 [2018-10-27 06:07:28,015 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:28,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:28,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:28,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:28,015 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:28,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:28,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:28,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:28,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-10-27 06:07:28,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:28,015 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:28,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,828 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 106 [2018-10-27 06:07:28,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:29,235 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:29,235 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:29,236 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-10-27 06:07:29,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:29,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:29,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:29,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,238 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-10-27 06:07:29,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:29,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:29,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,248 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-10-27 06:07:29,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:29,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:29,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:29,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,250 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-10-27 06:07:29,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:29,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:29,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:29,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,251 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-10-27 06:07:29,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:29,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:29,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:29,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,253 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-10-27 06:07:29,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:29,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:29,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:29,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,258 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-10-27 06:07:29,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:29,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:29,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:29,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:29,260 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-10-27 06:07:29,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:29,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:29,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:29,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:29,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:29,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:29,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:29,348 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:07:29,349 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:07:29,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:29,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:29,350 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:29,350 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2018-10-27 06:07:29,907 INFO L297 tatePredicateManager]: 61 out of 61 supporting invariants were superfluous and have been removed [2018-10-27 06:07:29,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:29,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:29,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:29,980 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-10-27 06:07:29,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 238 states and 259 transitions. cyclomatic complexity: 23 Second operand 4 states. [2018-10-27 06:07:29,996 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 238 states and 259 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 244 states and 266 transitions. Complement of second has 6 states. [2018-10-27 06:07:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:07:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2018-10-27 06:07:29,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 192 letters. Loop has 6 letters. [2018-10-27 06:07:29,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:29,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 198 letters. Loop has 6 letters. [2018-10-27 06:07:29,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:29,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 192 letters. Loop has 12 letters. [2018-10-27 06:07:30,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:30,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 266 transitions. [2018-10-27 06:07:30,001 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:30,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 0 states and 0 transitions. [2018-10-27 06:07:30,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:30,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:30,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:30,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:30,001 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:30,001 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:30,001 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:30,002 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-10-27 06:07:30,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:30,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:30,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:30,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:30 BoogieIcfgContainer [2018-10-27 06:07:30,007 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:30,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:30,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:30,008 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:30,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:51" (3/4) ... [2018-10-27 06:07:30,012 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:30,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:30,012 INFO L168 Benchmark]: Toolchain (without parser) took 39473.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 960.3 MB in the beginning and 852.6 MB in the end (delta: 107.7 MB). Peak memory consumption was 524.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,013 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:30,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.84 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.60 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,014 INFO L168 Benchmark]: Boogie Preprocessor took 26.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,014 INFO L168 Benchmark]: RCFGBuilder took 675.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,015 INFO L168 Benchmark]: BuchiAutomizer took 38522.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 852.6 MB in the end (delta: 255.6 MB). Peak memory consumption was 534.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,015 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.4 GB. Free memory is still 852.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:30,017 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.84 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.60 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.84 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 675.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38522.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 852.6 MB in the end (delta: 255.6 MB). Peak memory consumption was 534.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.4 GB. Free memory is still 852.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[#Ultimate.alloc_#res] + -8 * i and consists of 6 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 4 locations. 21 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.4s and 25 iterations. TraceHistogramMax:11. Analysis of lassos took 34.6s. Construction of modules took 2.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 23. Automata minimization 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 589 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 248 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1332 SDtfs, 2668 SDslu, 5325 SDs, 0 SdLazy, 1693 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital388 mio100 ax100 hnf99 lsp96 ukn63 mio100 lsp48 div100 bol100 ite100 ukn100 eq177 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...