./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-5842f4b [2018-11-18 10:27:44,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:27:44,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:27:44,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:27:44,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:27:44,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:27:44,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:27:44,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:27:44,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:27:44,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:27:44,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:27:44,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:27:44,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:27:44,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:27:44,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:27:44,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:27:44,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:27:44,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:27:44,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:27:44,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:27:44,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:27:44,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:27:44,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:27:44,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:27:44,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:27:44,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:27:44,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:27:44,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:27:44,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:27:44,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:27:44,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:27:44,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:27:44,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:27:44,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:27:44,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:27:44,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:27:44,328 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:27:44,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:27:44,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:27:44,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:27:44,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:27:44,339 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:27:44,339 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:27:44,339 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:27:44,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:27:44,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:27:44,341 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:27:44,342 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:27:44,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:27:44,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:27:44,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:27:44,342 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:27:44,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:27:44,342 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:27:44,343 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:27:44,343 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:27:44,344 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_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:44,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:27:44,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:27:44,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:27:44,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:27:44,381 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:27:44,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-11-18 10:27:44,429 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/data/93d2f61d6/2f2e9f4ceb6b420999ab9076027440fb/FLAG1f3acd1ff [2018-11-18 10:27:44,770 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:27:44,770 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/sv-benchmarks/c/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-11-18 10:27:44,774 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/data/93d2f61d6/2f2e9f4ceb6b420999ab9076027440fb/FLAG1f3acd1ff [2018-11-18 10:27:45,192 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/data/93d2f61d6/2f2e9f4ceb6b420999ab9076027440fb [2018-11-18 10:27:45,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:27:45,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:27:45,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:27:45,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:27:45,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:27:45,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad4eacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45, skipping insertion in model container [2018-11-18 10:27:45,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:27:45,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:27:45,343 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:27:45,350 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:27:45,363 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:27:45,374 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:27:45,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45 WrapperNode [2018-11-18 10:27:45,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:27:45,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:27:45,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:27:45,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:27:45,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:27:45,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:27:45,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:27:45,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:27:45,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... [2018-11-18 10:27:45,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:27:45,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:27:45,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:27:45,464 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:27:45,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:27:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:27:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:27:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:27:45,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:27:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:27:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:27:45,713 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:27:45,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:27:45 BoogieIcfgContainer [2018-11-18 10:27:45,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:27:45,714 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:27:45,714 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:27:45,717 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:27:45,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:27:45,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:27:45" (1/3) ... [2018-11-18 10:27:45,718 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2423614c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:27:45, skipping insertion in model container [2018-11-18 10:27:45,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:27:45,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:27:45" (2/3) ... [2018-11-18 10:27:45,719 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2423614c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:27:45, skipping insertion in model container [2018-11-18 10:27:45,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:27:45,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:27:45" (3/3) ... [2018-11-18 10:27:45,720 INFO L375 chiAutomizerObserver]: Analyzing ICFG max10_true-unreach-call_true-termination.i [2018-11-18 10:27:45,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:27:45,768 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:27:45,768 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:27:45,768 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:27:45,768 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:27:45,768 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:27:45,768 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:27:45,768 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:27:45,768 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:27:45,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-18 10:27:45,793 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-11-18 10:27:45,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:45,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:45,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:27:45,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:27:45,797 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:27:45,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-18 10:27:45,799 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-11-18 10:27:45,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:45,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:45,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:27:45,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:27:45,805 INFO L794 eck$LassoCheckResult]: Stem: 34#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-4true [2018-11-18 10:27:45,805 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-4true assume true; 14#L23-1true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 33#L23-3true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-4true [2018-11-18 10:27:45,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:27:45,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:45,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 10:27:45,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:45,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 10:27:45,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:45,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:45,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:45,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,031 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:27:46,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:27:46,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:27:46,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:27:46,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:27:46,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:27:46,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:27:46,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:27:46,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 10:27:46,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:27:46,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:27:46,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,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-11-18 10:27:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,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-11-18 10:27:46,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:46,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:27:46,264 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:27:46,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:46,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:46,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:46,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:46,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:46,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:46,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:46,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:46,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:46,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:46,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:46,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:46,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:46,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:46,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:46,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:27:46,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:46,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,288 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:27:46,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,289 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:27:46,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:46,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:46,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:46,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:46,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:46,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:46,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:46,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:27:46,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:46,326 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:27:46,345 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 10:27:46,345 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 10:27:46,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:27:46,348 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:27:46,348 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:27:46,348 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-18 10:27:46,351 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 10:27:46,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:27:46,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:46,432 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:27:46,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states. Second operand 4 states. [2018-11-18 10:27:46,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states.. Second operand 4 states. Result 98 states and 131 transitions. Complement of second has 8 states. [2018-11-18 10:27:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:27:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:27:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-18 10:27:46,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 10:27:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:27:46,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 10:27:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:27:46,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:27:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:27:46,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 131 transitions. [2018-11-18 10:27:46,554 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 31 states and 39 transitions. [2018-11-18 10:27:46,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 10:27:46,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:46,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 10:27:46,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:46,560 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 10:27:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 10:27:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 10:27:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 10:27:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 10:27:46,582 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 10:27:46,583 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 10:27:46,583 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:27:46,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-18 10:27:46,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:46,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:46,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:46,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:46,585 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 187#L23-4 assume true; 197#L23-1 assume !(main_~i~1 < 10); 198#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; 181#L9-4 [2018-11-18 10:27:46,585 INFO L796 eck$LassoCheckResult]: Loop: 181#L9-4 assume true; 182#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 185#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 193#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 183#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 181#L9-4 [2018-11-18 10:27:46,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 10:27:46,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:46,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:46,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:27:46,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:46,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 1 times [2018-11-18 10:27:46,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:27:46,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:27:46,681 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-18 10:27:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:46,690 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-18 10:27:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:27:46,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2018-11-18 10:27:46,691 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 40 transitions. [2018-11-18 10:27:46,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:46,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:46,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2018-11-18 10:27:46,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:46,693 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-18 10:27:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2018-11-18 10:27:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-18 10:27:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 10:27:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-18 10:27:46,695 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-18 10:27:46,695 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-18 10:27:46,695 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:27:46,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-18 10:27:46,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:46,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:46,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:46,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:46,697 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 258#L23-4 assume true; 270#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 271#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 280#L23-4 assume true; 268#L23-1 assume !(main_~i~1 < 10); 269#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; 252#L9-4 [2018-11-18 10:27:46,697 INFO L796 eck$LassoCheckResult]: Loop: 252#L9-4 assume true; 253#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 256#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 264#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 254#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 252#L9-4 [2018-11-18 10:27:46,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2018-11-18 10:27:46,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:46,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:46,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:27:46,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:46,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:46,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 10:27:46,764 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:46,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 2 times [2018-11-18 10:27:46,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:27:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:27:46,805 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 10:27:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:46,821 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-18 10:27:46,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:46,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-18 10:27:46,822 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-11-18 10:27:46,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:46,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:46,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-18 10:27:46,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:46,823 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-18 10:27:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-18 10:27:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 10:27:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 10:27:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-18 10:27:46,824 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-18 10:27:46,824 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-18 10:27:46,824 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:27:46,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2018-11-18 10:27:46,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:46,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:46,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-18 10:27:46,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:46,826 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 360#L23-4 assume true; 377#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 379#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 378#L23-4 assume true; 367#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 368#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 382#L23-4 assume true; 365#L23-1 assume !(main_~i~1 < 10); 366#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; 349#L9-4 [2018-11-18 10:27:46,826 INFO L796 eck$LassoCheckResult]: Loop: 349#L9-4 assume true; 350#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 353#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 361#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 351#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 349#L9-4 [2018-11-18 10:27:46,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1692719029, now seen corresponding path program 2 times [2018-11-18 10:27:46,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:46,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:46,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:27:46,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:27:46,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:27:46,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:46,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:46,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:46,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 10:27:46,914 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:46,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 3 times [2018-11-18 10:27:46,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:46,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:46,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:27:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:27:46,961 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:27:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:46,995 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-18 10:27:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:46,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-18 10:27:46,998 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:46,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 46 transitions. [2018-11-18 10:27:46,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:46,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:46,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-18 10:27:47,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:47,000 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 10:27:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-18 10:27:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-18 10:27:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 10:27:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-18 10:27:47,003 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 10:27:47,003 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 10:27:47,003 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:27:47,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2018-11-18 10:27:47,004 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:47,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:47,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2018-11-18 10:27:47,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:47,005 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 470#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 471#L23-4 assume true; 490#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 492#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 493#L23-4 assume true; 497#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 498#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 491#L23-4 assume true; 480#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 481#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 496#L23-4 assume true; 478#L23-1 assume !(main_~i~1 < 10); 479#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; 462#L9-4 [2018-11-18 10:27:47,006 INFO L796 eck$LassoCheckResult]: Loop: 462#L9-4 assume true; 463#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 466#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 474#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 464#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 462#L9-4 [2018-11-18 10:27:47,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 3 times [2018-11-18 10:27:47,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:47,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:27:47,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:27:47,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 10:27:47,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:47,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:47,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 10:27:47,123 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:47,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 4 times [2018-11-18 10:27:47,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:27:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:27:47,168 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 10:27:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:47,181 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-18 10:27:47,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:27:47,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-18 10:27:47,182 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 49 transitions. [2018-11-18 10:27:47,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:47,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:47,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2018-11-18 10:27:47,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:47,184 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-18 10:27:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2018-11-18 10:27:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-18 10:27:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 10:27:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-18 10:27:47,186 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-18 10:27:47,186 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-18 10:27:47,186 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:27:47,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2018-11-18 10:27:47,186 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:47,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:47,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2018-11-18 10:27:47,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:47,187 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 599#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 600#L23-4 assume true; 619#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 630#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 620#L23-4 assume true; 609#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 610#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 621#L23-4 assume true; 629#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 628#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 627#L23-4 assume true; 625#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 626#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 624#L23-4 assume true; 607#L23-1 assume !(main_~i~1 < 10); 608#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; 591#L9-4 [2018-11-18 10:27:47,187 INFO L796 eck$LassoCheckResult]: Loop: 591#L9-4 assume true; 592#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 595#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 603#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 593#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 591#L9-4 [2018-11-18 10:27:47,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 4 times [2018-11-18 10:27:47,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:47,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:27:47,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:27:47,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:27:47,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:47,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:47,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 10:27:47,311 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:47,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 5 times [2018-11-18 10:27:47,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:27:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:27:47,353 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-18 10:27:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:47,368 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 10:27:47,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:27:47,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-11-18 10:27:47,369 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 52 transitions. [2018-11-18 10:27:47,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:47,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:47,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2018-11-18 10:27:47,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:47,371 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-18 10:27:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2018-11-18 10:27:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-18 10:27:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 10:27:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 10:27:47,375 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 10:27:47,375 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 10:27:47,375 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:27:47,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-11-18 10:27:47,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:47,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:47,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1] [2018-11-18 10:27:47,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:47,376 INFO L794 eck$LassoCheckResult]: Stem: 767#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 746#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 747#L23-4 assume true; 764#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 778#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 765#L23-4 assume true; 754#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 755#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 766#L23-4 assume true; 777#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 776#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 775#L23-4 assume true; 774#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 773#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 772#L23-4 assume true; 770#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 771#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 769#L23-4 assume true; 752#L23-1 assume !(main_~i~1 < 10); 753#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; 736#L9-4 [2018-11-18 10:27:47,376 INFO L796 eck$LassoCheckResult]: Loop: 736#L9-4 assume true; 737#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 740#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 748#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 738#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 736#L9-4 [2018-11-18 10:27:47,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1041220151, now seen corresponding path program 5 times [2018-11-18 10:27:47,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:47,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:47,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:27:47,458 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 10:27:47,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:47,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:47,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 10:27:47,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:47,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 6 times [2018-11-18 10:27:47,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:27:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:27:47,541 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-18 10:27:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:47,560 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-18 10:27:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:27:47,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-11-18 10:27:47,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 55 transitions. [2018-11-18 10:27:47,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:47,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:47,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 55 transitions. [2018-11-18 10:27:47,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:47,563 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-18 10:27:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 55 transitions. [2018-11-18 10:27:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 10:27:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 10:27:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 10:27:47,565 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 10:27:47,565 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 10:27:47,565 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:27:47,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2018-11-18 10:27:47,567 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:47,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:47,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1, 1] [2018-11-18 10:27:47,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:47,568 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 902#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 903#L23-4 assume true; 925#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 942#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 926#L23-4 assume true; 915#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 916#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 927#L23-4 assume true; 941#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 940#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 939#L23-4 assume true; 938#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 937#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 936#L23-4 assume true; 935#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 934#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 933#L23-4 assume true; 931#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 932#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 930#L23-4 assume true; 913#L23-1 assume !(main_~i~1 < 10); 914#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; 897#L9-4 [2018-11-18 10:27:47,568 INFO L796 eck$LassoCheckResult]: Loop: 897#L9-4 assume true; 898#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 901#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 909#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 899#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 897#L9-4 [2018-11-18 10:27:47,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -733972789, now seen corresponding path program 6 times [2018-11-18 10:27:47,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:47,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:47,642 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 10:27:47,664 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 10:27:47,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:47,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:47,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 10:27:47,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:47,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 7 times [2018-11-18 10:27:47,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:27:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:27:47,734 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-18 10:27:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:47,760 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-18 10:27:47,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:27:47,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 59 transitions. [2018-11-18 10:27:47,761 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 51 states and 58 transitions. [2018-11-18 10:27:47,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:47,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:47,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2018-11-18 10:27:47,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:47,762 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-18 10:27:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2018-11-18 10:27:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-18 10:27:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 10:27:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 10:27:47,764 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 10:27:47,764 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 10:27:47,764 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:27:47,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2018-11-18 10:27:47,765 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:47,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:47,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1, 1] [2018-11-18 10:27:47,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:47,767 INFO L794 eck$LassoCheckResult]: Stem: 1105#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1084#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1085#L23-4 assume true; 1102#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1122#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1103#L23-4 assume true; 1092#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1093#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1104#L23-4 assume true; 1121#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1120#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1119#L23-4 assume true; 1118#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1117#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1116#L23-4 assume true; 1115#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1114#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1113#L23-4 assume true; 1112#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1111#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1110#L23-4 assume true; 1108#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1109#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1107#L23-4 assume true; 1090#L23-1 assume !(main_~i~1 < 10); 1091#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; 1074#L9-4 [2018-11-18 10:27:47,768 INFO L796 eck$LassoCheckResult]: Loop: 1074#L9-4 assume true; 1075#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1078#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1086#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1076#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1074#L9-4 [2018-11-18 10:27:47,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -103119223, now seen corresponding path program 7 times [2018-11-18 10:27:47,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:47,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:47,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:47,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:47,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:47,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 10:27:47,905 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:47,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 8 times [2018-11-18 10:27:47,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:47,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:27:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:27:47,948 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-18 10:27:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:47,970 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-18 10:27:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:27:47,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2018-11-18 10:27:47,974 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 61 transitions. [2018-11-18 10:27:47,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:47,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:47,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 61 transitions. [2018-11-18 10:27:47,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:47,975 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-18 10:27:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 61 transitions. [2018-11-18 10:27:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 10:27:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 10:27:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-18 10:27:47,978 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-18 10:27:47,978 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-18 10:27:47,978 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:27:47,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 59 transitions. [2018-11-18 10:27:47,978 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:47,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:47,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:47,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1] [2018-11-18 10:27:47,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:47,979 INFO L794 eck$LassoCheckResult]: Stem: 1298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1272#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1273#L23-4 assume true; 1295#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1318#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1296#L23-4 assume true; 1285#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1286#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1297#L23-4 assume true; 1317#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1316#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1315#L23-4 assume true; 1314#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1313#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1312#L23-4 assume true; 1311#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1310#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1309#L23-4 assume true; 1308#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1307#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1306#L23-4 assume true; 1305#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1304#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1303#L23-4 assume true; 1301#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1302#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1300#L23-4 assume true; 1283#L23-1 assume !(main_~i~1 < 10); 1284#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; 1267#L9-4 [2018-11-18 10:27:47,979 INFO L796 eck$LassoCheckResult]: Loop: 1267#L9-4 assume true; 1268#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1271#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1279#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1269#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1267#L9-4 [2018-11-18 10:27:47,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1121421813, now seen corresponding path program 8 times [2018-11-18 10:27:47,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:47,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:48,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:48,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:48,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:27:48,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:27:48,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:48,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:48,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:48,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 10:27:48,129 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:48,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 9 times [2018-11-18 10:27:48,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:27:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:27:48,177 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. cyclomatic complexity: 12 Second operand 12 states. [2018-11-18 10:27:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:48,194 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-18 10:27:48,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:27:48,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 65 transitions. [2018-11-18 10:27:48,195 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:48,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 64 transitions. [2018-11-18 10:27:48,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:48,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:48,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 64 transitions. [2018-11-18 10:27:48,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:48,195 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-18 10:27:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 64 transitions. [2018-11-18 10:27:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-18 10:27:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 10:27:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-18 10:27:48,197 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-18 10:27:48,197 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-18 10:27:48,197 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:27:48,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 62 transitions. [2018-11-18 10:27:48,197 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:48,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:48,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:48,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1, 1] [2018-11-18 10:27:48,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:48,198 INFO L794 eck$LassoCheckResult]: Stem: 1507#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1481#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1482#L23-4 assume true; 1504#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1530#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1505#L23-4 assume true; 1494#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1495#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1506#L23-4 assume true; 1529#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1528#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1527#L23-4 assume true; 1526#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1525#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1524#L23-4 assume true; 1523#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1522#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1521#L23-4 assume true; 1520#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1519#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1518#L23-4 assume true; 1517#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1516#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1515#L23-4 assume true; 1514#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1513#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1512#L23-4 assume true; 1510#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1511#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1509#L23-4 assume true; 1492#L23-1 assume !(main_~i~1 < 10); 1493#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; 1476#L9-4 [2018-11-18 10:27:48,198 INFO L796 eck$LassoCheckResult]: Loop: 1476#L9-4 assume true; 1477#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1480#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1488#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1478#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1476#L9-4 [2018-11-18 10:27:48,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2019868855, now seen corresponding path program 9 times [2018-11-18 10:27:48,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:48,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:48,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:48,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:48,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:27:48,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 10:27:48,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:48,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:48,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:48,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 10:27:48,347 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:48,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 10 times [2018-11-18 10:27:48,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:48,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:27:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:27:48,378 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-18 10:27:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:48,407 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-18 10:27:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:27:48,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 67 transitions. [2018-11-18 10:27:48,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:48,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 66 transitions. [2018-11-18 10:27:48,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 10:27:48,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:27:48,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 66 transitions. [2018-11-18 10:27:48,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:48,411 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-18 10:27:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 66 transitions. [2018-11-18 10:27:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-18 10:27:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 10:27:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-18 10:27:48,413 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-18 10:27:48,413 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-18 10:27:48,413 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 10:27:48,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 65 transitions. [2018-11-18 10:27:48,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:27:48,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:48,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:48,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1] [2018-11-18 10:27:48,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:48,415 INFO L794 eck$LassoCheckResult]: Stem: 1731#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1710#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1711#L23-4 assume true; 1728#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1757#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1729#L23-4 assume true; 1718#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1719#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1730#L23-4 assume true; 1756#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1755#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1754#L23-4 assume true; 1753#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1752#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1751#L23-4 assume true; 1750#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1749#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1748#L23-4 assume true; 1747#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1746#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1745#L23-4 assume true; 1744#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1743#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1742#L23-4 assume true; 1741#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1740#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1739#L23-4 assume true; 1738#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1737#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1736#L23-4 assume true; 1734#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1735#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1733#L23-4 assume true; 1716#L23-1 assume !(main_~i~1 < 10); 1717#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; 1700#L9-4 [2018-11-18 10:27:48,415 INFO L796 eck$LassoCheckResult]: Loop: 1700#L9-4 assume true; 1701#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1704#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1712#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1702#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1700#L9-4 [2018-11-18 10:27:48,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1419508405, now seen corresponding path program 10 times [2018-11-18 10:27:48,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 11 times [2018-11-18 10:27:48,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash -595148337, now seen corresponding path program 1 times [2018-11-18 10:27:48,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:48,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:48,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:48,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:51,084 WARN L180 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2018-11-18 10:27:51,184 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:27:51,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:27:51,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:27:51,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:27:51,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:27:51,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:27:51,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:27:51,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:27:51,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-18 10:27:51,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:27:51,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:27:51,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-11-18 10:27:51,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:27:51,412 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:27:51,412 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:27:51,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:51,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:51,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:51,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:51,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:51,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:51,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:51,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:51,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:51,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:51,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:51,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:51,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:51,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:51,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:51,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:27:51,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:51,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:27:51,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:27:51,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:27:51,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:27:51,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:51,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,438 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:27:51,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,440 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:27:51,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:51,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:27:51,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:27:51,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:27:51,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:27:51,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:27:51,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:27:51,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:27:51,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:27:51,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:27:51,463 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:27:51,463 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 10:27:51,463 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:27:51,464 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:27:51,464 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:27:51,464 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 19 Supporting invariants [] [2018-11-18 10:27:51,487 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 10:27:51,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:27:51,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:27:51,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 65 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 10:27:51,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 65 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 65 states and 74 transitions. Complement of second has 7 states. [2018-11-18 10:27:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:27:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:27:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 10:27:51,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 35 letters. Loop has 5 letters. [2018-11-18 10:27:51,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:27:51,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 40 letters. Loop has 5 letters. [2018-11-18 10:27:51,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:27:51,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 35 letters. Loop has 10 letters. [2018-11-18 10:27:51,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:27:51,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2018-11-18 10:27:51,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:51,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 68 transitions. [2018-11-18 10:27:51,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 10:27:51,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 10:27:51,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2018-11-18 10:27:51,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:51,564 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-18 10:27:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2018-11-18 10:27:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-18 10:27:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 10:27:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-18 10:27:51,569 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-18 10:27:51,569 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-18 10:27:51,569 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 10:27:51,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-11-18 10:27:51,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:51,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:51,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:51,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:51,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:51,571 INFO L794 eck$LassoCheckResult]: Stem: 2012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1991#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1992#L23-4 assume true; 2009#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2038#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2010#L23-4 assume true; 1999#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2000#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2011#L23-4 assume true; 2037#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2036#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2035#L23-4 assume true; 2034#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2033#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2032#L23-4 assume true; 2031#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2030#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2029#L23-4 assume true; 2028#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2027#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2026#L23-4 assume true; 2025#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2024#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2023#L23-4 assume true; 2022#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2021#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2020#L23-4 assume true; 2019#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2018#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2017#L23-4 assume true; 2015#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2016#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2014#L23-4 assume true; 1997#L23-1 assume !(main_~i~1 < 10); 1998#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; 1979#L9-4 assume true; 1981#L9-1 assume !(max_~i~0 < 10); 1984#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2001#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 1986#L9-10 [2018-11-18 10:27:51,571 INFO L796 eck$LassoCheckResult]: Loop: 1986#L9-10 assume true; 1987#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2003#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2006#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1994#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1986#L9-10 [2018-11-18 10:27:51,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1543220592, now seen corresponding path program 1 times [2018-11-18 10:27:51,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 10:27:51,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:51,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:27:51,627 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:51,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 71729905, now seen corresponding path program 1 times [2018-11-18 10:27:51,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:27:51,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:27:51,658 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-18 10:27:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:51,680 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-18 10:27:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:27:51,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 85 transitions. [2018-11-18 10:27:51,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:51,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 84 transitions. [2018-11-18 10:27:51,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 10:27:51,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 10:27:51,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 84 transitions. [2018-11-18 10:27:51,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:51,682 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-11-18 10:27:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 84 transitions. [2018-11-18 10:27:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2018-11-18 10:27:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 10:27:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-18 10:27:51,685 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-18 10:27:51,685 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-18 10:27:51,685 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 10:27:51,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 69 transitions. [2018-11-18 10:27:51,685 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:51,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:51,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:51,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:51,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:51,687 INFO L794 eck$LassoCheckResult]: Stem: 2153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2132#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2133#L23-4 assume true; 2141#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2142#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2150#L23-4 assume true; 2151#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2181#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2180#L23-4 assume true; 2179#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2178#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2177#L23-4 assume true; 2176#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2175#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2174#L23-4 assume true; 2173#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2172#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2171#L23-4 assume true; 2170#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2169#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2168#L23-4 assume true; 2167#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2166#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2165#L23-4 assume true; 2164#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2163#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2162#L23-4 assume true; 2161#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2160#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2158#L23-4 assume true; 2156#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2157#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2155#L23-4 assume true; 2139#L23-1 assume !(main_~i~1 < 10); 2140#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; 2120#L9-4 assume true; 2121#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2126#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2134#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2124#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2122#L9-4 assume true; 2123#L9-1 assume !(max_~i~0 < 10); 2125#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2143#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 2127#L9-10 assume true; 2128#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2144#L10-3 [2018-11-18 10:27:51,687 INFO L796 eck$LassoCheckResult]: Loop: 2144#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2147#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2135#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2136#L9-10 assume true; 2159#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2144#L10-3 [2018-11-18 10:27:51,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2036393029, now seen corresponding path program 1 times [2018-11-18 10:27:51,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 10:27:51,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:51,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:51,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 10:27:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:51,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 10:27:51,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:51,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 2 times [2018-11-18 10:27:51,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:27:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:27:51,860 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 10:27:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:51,886 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-18 10:27:51,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:27:51,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 103 transitions. [2018-11-18 10:27:51,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:51,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 89 states and 102 transitions. [2018-11-18 10:27:51,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 10:27:51,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 10:27:51,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 102 transitions. [2018-11-18 10:27:51,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:51,887 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 102 transitions. [2018-11-18 10:27:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 102 transitions. [2018-11-18 10:27:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2018-11-18 10:27:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 10:27:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-18 10:27:51,889 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-18 10:27:51,889 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-18 10:27:51,889 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 10:27:51,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 81 transitions. [2018-11-18 10:27:51,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:51,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:51,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:51,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:51,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:51,890 INFO L794 eck$LassoCheckResult]: Stem: 2451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2424#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2425#L23-4 assume true; 2437#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2438#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2448#L23-4 assume true; 2449#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2485#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2484#L23-4 assume true; 2483#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2482#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2481#L23-4 assume true; 2480#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2479#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2478#L23-4 assume true; 2477#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2476#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2475#L23-4 assume true; 2474#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2473#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2472#L23-4 assume true; 2471#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2470#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2469#L23-4 assume true; 2468#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2467#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2466#L23-4 assume true; 2464#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2462#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2459#L23-4 assume true; 2457#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2458#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2456#L23-4 assume true; 2435#L23-1 assume !(main_~i~1 < 10); 2436#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; 2415#L9-4 assume true; 2416#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2455#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2454#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2453#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2417#L9-4 assume true; 2418#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2423#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2431#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2419#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2420#L9-4 assume true; 2421#L9-1 assume !(max_~i~0 < 10); 2422#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2439#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 2440#L9-10 assume true; 2441#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2442#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2445#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2432#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2426#L9-10 assume true; 2427#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2461#L10-3 [2018-11-18 10:27:51,890 INFO L796 eck$LassoCheckResult]: Loop: 2461#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2486#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2465#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2463#L9-10 assume true; 2460#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2461#L10-3 [2018-11-18 10:27:51,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1192504791, now seen corresponding path program 1 times [2018-11-18 10:27:51,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:51,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:51,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:51,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-18 10:27:51,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:51,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:51,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:51,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-18 10:27:52,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:52,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 10:27:52,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:52,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 3 times [2018-11-18 10:27:52,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:27:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:27:52,056 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-18 10:27:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:52,098 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-11-18 10:27:52,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:27:52,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 121 transitions. [2018-11-18 10:27:52,099 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 120 transitions. [2018-11-18 10:27:52,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-18 10:27:52,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-18 10:27:52,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 120 transitions. [2018-11-18 10:27:52,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:52,100 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-11-18 10:27:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 120 transitions. [2018-11-18 10:27:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2018-11-18 10:27:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 10:27:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-18 10:27:52,102 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-18 10:27:52,102 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-18 10:27:52,102 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 10:27:52,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2018-11-18 10:27:52,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:52,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:52,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:52,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:52,104 INFO L794 eck$LassoCheckResult]: Stem: 2807#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2775#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2776#L23-4 assume true; 2790#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2791#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2804#L23-4 assume true; 2805#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2840#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2839#L23-4 assume true; 2838#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2837#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2836#L23-4 assume true; 2835#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2834#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2833#L23-4 assume true; 2832#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2831#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2830#L23-4 assume true; 2829#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2828#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2827#L23-4 assume true; 2826#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2825#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2824#L23-4 assume true; 2823#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2822#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2821#L23-4 assume true; 2820#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2818#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2816#L23-4 assume true; 2813#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2814#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2812#L23-4 assume true; 2788#L23-1 assume !(main_~i~1 < 10); 2789#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; 2766#L9-4 assume true; 2767#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2774#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2802#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2803#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2768#L9-4 assume true; 2769#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2782#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2783#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2770#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2771#L9-4 assume true; 2810#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2843#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2842#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2811#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2809#L9-4 assume true; 2772#L9-1 assume !(max_~i~0 < 10); 2773#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2792#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 2793#L9-10 assume true; 2844#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2845#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2846#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2784#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2785#L9-10 assume true; 2847#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2801#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2797#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2798#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2777#L9-10 assume true; 2778#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2794#L10-3 [2018-11-18 10:27:52,104 INFO L796 eck$LassoCheckResult]: Loop: 2794#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2841#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 2819#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2817#L9-10 assume true; 2815#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2794#L10-3 [2018-11-18 10:27:52,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1478238459, now seen corresponding path program 2 times [2018-11-18 10:27:52,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-18 10:27:52,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:52,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:27:52,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:27:52,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:52,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-18 10:27:52,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:52,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 10:27:52,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:52,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 4 times [2018-11-18 10:27:52,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:27:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:27:52,304 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-18 10:27:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:52,344 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2018-11-18 10:27:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:27:52,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 139 transitions. [2018-11-18 10:27:52,345 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 119 states and 138 transitions. [2018-11-18 10:27:52,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-18 10:27:52,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-18 10:27:52,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2018-11-18 10:27:52,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:52,346 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-11-18 10:27:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2018-11-18 10:27:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2018-11-18 10:27:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 10:27:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-11-18 10:27:52,349 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-11-18 10:27:52,349 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-11-18 10:27:52,349 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 10:27:52,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 105 transitions. [2018-11-18 10:27:52,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:52,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:52,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:52,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:52,351 INFO L794 eck$LassoCheckResult]: Stem: 3209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3186#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3187#L23-4 assume true; 3195#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3196#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3206#L23-4 assume true; 3207#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3243#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3242#L23-4 assume true; 3241#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3240#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3239#L23-4 assume true; 3238#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3237#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3236#L23-4 assume true; 3235#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3234#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3233#L23-4 assume true; 3232#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3231#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3230#L23-4 assume true; 3229#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3228#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3227#L23-4 assume true; 3226#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3225#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3224#L23-4 assume true; 3223#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3221#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3219#L23-4 assume true; 3215#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3216#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3214#L23-4 assume true; 3193#L23-1 assume !(main_~i~1 < 10); 3194#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; 3173#L9-4 assume true; 3174#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3180#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3188#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3177#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3175#L9-4 assume true; 3176#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3264#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3263#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3262#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3261#L9-4 assume true; 3260#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3259#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3258#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3256#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3254#L9-4 assume true; 3212#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3246#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3244#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3213#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3211#L9-4 assume true; 3178#L9-1 assume !(max_~i~0 < 10); 3179#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3197#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 3181#L9-10 assume true; 3182#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3257#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3255#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3189#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3190#L9-10 assume true; 3198#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3199#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3202#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3203#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3253#L9-10 assume true; 3252#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3251#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3250#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3249#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3248#L9-10 assume true; 3247#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3218#L10-3 [2018-11-18 10:27:52,351 INFO L796 eck$LassoCheckResult]: Loop: 3218#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 3245#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3222#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3220#L9-10 assume true; 3217#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3218#L10-3 [2018-11-18 10:27:52,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1609160169, now seen corresponding path program 3 times [2018-11-18 10:27:52,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-18 10:27:52,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:52,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:52,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:27:52,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 10:27:52,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:52,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-18 10:27:52,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 10:27:52,516 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:52,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 5 times [2018-11-18 10:27:52,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:27:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:27:52,561 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-18 10:27:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:52,614 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2018-11-18 10:27:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:27:52,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 157 transitions. [2018-11-18 10:27:52,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 134 states and 156 transitions. [2018-11-18 10:27:52,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-18 10:27:52,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-18 10:27:52,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 156 transitions. [2018-11-18 10:27:52,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:52,617 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 156 transitions. [2018-11-18 10:27:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 156 transitions. [2018-11-18 10:27:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-11-18 10:27:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 10:27:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-11-18 10:27:52,620 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-11-18 10:27:52,620 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-11-18 10:27:52,620 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 10:27:52,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 117 transitions. [2018-11-18 10:27:52,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:52,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:52,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:52,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:52,622 INFO L794 eck$LassoCheckResult]: Stem: 3672#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3649#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3650#L23-4 assume true; 3658#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3659#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3669#L23-4 assume true; 3670#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3706#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3705#L23-4 assume true; 3704#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3703#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3702#L23-4 assume true; 3701#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3700#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3699#L23-4 assume true; 3698#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3697#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3696#L23-4 assume true; 3695#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3694#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3693#L23-4 assume true; 3692#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3691#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3690#L23-4 assume true; 3689#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3688#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3687#L23-4 assume true; 3686#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3684#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3682#L23-4 assume true; 3678#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 3679#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 3677#L23-4 assume true; 3656#L23-1 assume !(main_~i~1 < 10); 3657#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; 3636#L9-4 assume true; 3637#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3651#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3652#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3640#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3638#L9-4 assume true; 3639#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3643#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3737#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3736#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3735#L9-4 assume true; 3734#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3733#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3732#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3731#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3730#L9-4 assume true; 3729#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3728#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3727#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3724#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3722#L9-4 assume true; 3675#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3709#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3707#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3676#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3674#L9-4 assume true; 3641#L9-1 assume !(max_~i~0 < 10); 3642#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 3660#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 3661#L9-10 assume true; 3726#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3725#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3723#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3653#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3644#L9-10 assume true; 3645#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3662#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3665#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3666#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3721#L9-10 assume true; 3720#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3719#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3718#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3717#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3716#L9-10 assume true; 3715#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3714#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 3713#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3712#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3711#L9-10 assume true; 3710#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3681#L10-3 [2018-11-18 10:27:52,622 INFO L796 eck$LassoCheckResult]: Loop: 3681#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 3708#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 3685#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 3683#L9-10 assume true; 3680#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 3681#L10-3 [2018-11-18 10:27:52,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash -25758149, now seen corresponding path program 4 times [2018-11-18 10:27:52,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-18 10:27:52,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:52,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:27:52,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:27:52,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:52,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-18 10:27:52,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:52,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 10:27:52,756 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:52,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 6 times [2018-11-18 10:27:52,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:27:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:27:52,810 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. cyclomatic complexity: 20 Second operand 9 states. [2018-11-18 10:27:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:52,871 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-11-18 10:27:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:27:52,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 175 transitions. [2018-11-18 10:27:52,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 149 states and 174 transitions. [2018-11-18 10:27:52,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-18 10:27:52,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-18 10:27:52,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 174 transitions. [2018-11-18 10:27:52,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:52,874 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 174 transitions. [2018-11-18 10:27:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 174 transitions. [2018-11-18 10:27:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 112. [2018-11-18 10:27:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 10:27:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2018-11-18 10:27:52,876 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 129 transitions. [2018-11-18 10:27:52,876 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 129 transitions. [2018-11-18 10:27:52,877 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 10:27:52,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 129 transitions. [2018-11-18 10:27:52,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:52,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:52,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:52,884 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:52,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:52,885 INFO L794 eck$LassoCheckResult]: Stem: 4192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4169#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4170#L23-4 assume true; 4178#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4179#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4189#L23-4 assume true; 4190#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4226#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4225#L23-4 assume true; 4224#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4223#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4222#L23-4 assume true; 4221#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4220#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4219#L23-4 assume true; 4218#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4217#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4216#L23-4 assume true; 4215#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4214#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4213#L23-4 assume true; 4212#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4211#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4210#L23-4 assume true; 4209#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4208#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4207#L23-4 assume true; 4206#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4204#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4202#L23-4 assume true; 4198#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4199#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4197#L23-4 assume true; 4176#L23-1 assume !(main_~i~1 < 10); 4177#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; 4155#L9-4 assume true; 4156#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4163#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4266#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4265#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4157#L9-4 assume true; 4158#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4171#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4172#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4159#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4160#L9-4 assume true; 4264#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4263#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4262#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4261#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4260#L9-4 assume true; 4259#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4258#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4257#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4256#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4255#L9-4 assume true; 4254#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4253#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4252#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4249#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4247#L9-4 assume true; 4195#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4229#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4227#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4196#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4194#L9-4 assume true; 4161#L9-1 assume !(max_~i~0 < 10); 4162#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4180#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 4181#L9-10 assume true; 4251#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4250#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4248#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4173#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4164#L9-10 assume true; 4165#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4182#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4185#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4186#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4246#L9-10 assume true; 4245#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4244#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4243#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4242#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4241#L9-10 assume true; 4240#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4239#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4238#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4237#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4236#L9-10 assume true; 4235#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4234#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4233#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4232#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4231#L9-10 assume true; 4230#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4201#L10-3 [2018-11-18 10:27:52,885 INFO L796 eck$LassoCheckResult]: Loop: 4201#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 4228#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4205#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4203#L9-10 assume true; 4200#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4201#L10-3 [2018-11-18 10:27:52,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1723959721, now seen corresponding path program 5 times [2018-11-18 10:27:52,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:52,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-11-18 10:27:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:52,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:52,951 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:27:53,016 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-18 10:27:53,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:53,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-11-18 10:27:53,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:53,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 10:27:53,046 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:53,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 7 times [2018-11-18 10:27:53,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:53,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:53,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:27:53,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:27:53,094 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. cyclomatic complexity: 22 Second operand 10 states. [2018-11-18 10:27:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:53,168 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2018-11-18 10:27:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:27:53,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 193 transitions. [2018-11-18 10:27:53,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:53,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 164 states and 192 transitions. [2018-11-18 10:27:53,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-11-18 10:27:53,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-11-18 10:27:53,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 192 transitions. [2018-11-18 10:27:53,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:53,171 INFO L705 BuchiCegarLoop]: Abstraction has 164 states and 192 transitions. [2018-11-18 10:27:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 192 transitions. [2018-11-18 10:27:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 122. [2018-11-18 10:27:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 10:27:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2018-11-18 10:27:53,174 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 141 transitions. [2018-11-18 10:27:53,174 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 141 transitions. [2018-11-18 10:27:53,174 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 10:27:53,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 141 transitions. [2018-11-18 10:27:53,175 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:53,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:53,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:53,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:53,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:53,176 INFO L794 eck$LassoCheckResult]: Stem: 4769#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4744#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4745#L23-4 assume true; 4753#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4754#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4766#L23-4 assume true; 4767#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4803#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4802#L23-4 assume true; 4801#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4800#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4799#L23-4 assume true; 4798#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4797#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4796#L23-4 assume true; 4795#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4794#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4793#L23-4 assume true; 4792#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4791#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4790#L23-4 assume true; 4789#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4788#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4787#L23-4 assume true; 4786#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4785#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4784#L23-4 assume true; 4783#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4781#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4779#L23-4 assume true; 4775#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 4776#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 4774#L23-4 assume true; 4751#L23-1 assume !(main_~i~1 < 10); 4752#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; 4730#L9-4 assume true; 4731#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4738#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4764#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4765#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4732#L9-4 assume true; 4733#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4746#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4747#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4734#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4735#L9-4 assume true; 4851#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4850#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4849#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4848#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4847#L9-4 assume true; 4846#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4845#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4844#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4843#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4842#L9-4 assume true; 4841#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4840#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4839#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4838#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4837#L9-4 assume true; 4836#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4835#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4834#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4831#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4829#L9-4 assume true; 4772#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4806#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4804#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4773#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4771#L9-4 assume true; 4736#L9-1 assume !(max_~i~0 < 10); 4737#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 4755#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 4756#L9-10 assume true; 4833#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4832#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4830#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4748#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4739#L9-10 assume true; 4740#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4757#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4760#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4761#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4828#L9-10 assume true; 4827#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4826#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4825#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4824#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4823#L9-10 assume true; 4822#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4821#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4820#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4819#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4818#L9-10 assume true; 4817#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4816#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4815#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4814#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4813#L9-10 assume true; 4812#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4811#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 4810#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4809#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4808#L9-10 assume true; 4807#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4778#L10-3 [2018-11-18 10:27:53,176 INFO L796 eck$LassoCheckResult]: Loop: 4778#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 4805#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 4782#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 4780#L9-10 assume true; 4777#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 4778#L10-3 [2018-11-18 10:27:53,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1060871035, now seen corresponding path program 6 times [2018-11-18 10:27:53,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:53,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-18 10:27:53,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:53,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:53,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 10:27:53,375 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-18 10:27:53,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:53,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-18 10:27:53,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:53,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 10:27:53,406 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:53,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 8 times [2018-11-18 10:27:53,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:53,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:27:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:27:53,458 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. cyclomatic complexity: 24 Second operand 11 states. [2018-11-18 10:27:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:53,542 INFO L93 Difference]: Finished difference Result 180 states and 211 transitions. [2018-11-18 10:27:53,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:27:53,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 211 transitions. [2018-11-18 10:27:53,544 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:53,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 179 states and 210 transitions. [2018-11-18 10:27:53,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2018-11-18 10:27:53,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-18 10:27:53,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 210 transitions. [2018-11-18 10:27:53,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:53,546 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 210 transitions. [2018-11-18 10:27:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 210 transitions. [2018-11-18 10:27:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2018-11-18 10:27:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 10:27:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2018-11-18 10:27:53,549 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2018-11-18 10:27:53,549 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2018-11-18 10:27:53,549 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 10:27:53,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2018-11-18 10:27:53,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:53,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:53,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:53,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:53,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:53,556 INFO L794 eck$LassoCheckResult]: Stem: 5400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5370#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5371#L23-4 assume true; 5384#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5385#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5397#L23-4 assume true; 5398#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5434#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5433#L23-4 assume true; 5432#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5431#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5430#L23-4 assume true; 5429#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5428#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5427#L23-4 assume true; 5426#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5425#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5424#L23-4 assume true; 5423#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5422#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5421#L23-4 assume true; 5420#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5419#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5418#L23-4 assume true; 5417#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5416#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5415#L23-4 assume true; 5414#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5412#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5410#L23-4 assume true; 5406#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 5407#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 5405#L23-4 assume true; 5382#L23-1 assume !(main_~i~1 < 10); 5383#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; 5361#L9-4 assume true; 5362#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5369#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5377#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5491#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5363#L9-4 assume true; 5364#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5492#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5395#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5396#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5472#L9-4 assume true; 5490#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5489#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5488#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5487#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5486#L9-4 assume true; 5485#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5484#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5483#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5482#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5481#L9-4 assume true; 5480#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5479#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5478#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5477#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5476#L9-4 assume true; 5475#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5474#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5473#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5365#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5366#L9-4 assume true; 5471#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5470#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5469#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5468#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5467#L9-4 assume true; 5403#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5437#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5435#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5404#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5402#L9-4 assume true; 5367#L9-1 assume !(max_~i~0 < 10); 5368#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 5386#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 5372#L9-10 assume true; 5373#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5387#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5465#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5378#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5379#L9-10 assume true; 5466#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5394#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5390#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5391#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5464#L9-10 assume true; 5463#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5462#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5461#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5460#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5459#L9-10 assume true; 5458#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5457#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5455#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5454#L9-10 assume true; 5453#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5452#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5451#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5450#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5449#L9-10 assume true; 5448#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5447#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5446#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5445#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5444#L9-10 assume true; 5443#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5442#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 5441#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5440#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5439#L9-10 assume true; 5438#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5409#L10-3 [2018-11-18 10:27:53,556 INFO L796 eck$LassoCheckResult]: Loop: 5409#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 5436#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 5413#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 5411#L9-10 assume true; 5408#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 5409#L10-3 [2018-11-18 10:27:53,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash -39391895, now seen corresponding path program 7 times [2018-11-18 10:27:53,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-11-18 10:27:53,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:53,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:53,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-11-18 10:27:53,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:53,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 10:27:53,701 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:53,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 9 times [2018-11-18 10:27:53,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:53,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:27:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:27:53,750 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. cyclomatic complexity: 26 Second operand 12 states. [2018-11-18 10:27:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:53,841 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2018-11-18 10:27:53,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:27:53,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 229 transitions. [2018-11-18 10:27:53,843 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:53,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 194 states and 228 transitions. [2018-11-18 10:27:53,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2018-11-18 10:27:53,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2018-11-18 10:27:53,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 228 transitions. [2018-11-18 10:27:53,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:53,844 INFO L705 BuchiCegarLoop]: Abstraction has 194 states and 228 transitions. [2018-11-18 10:27:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 228 transitions. [2018-11-18 10:27:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 142. [2018-11-18 10:27:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 10:27:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-11-18 10:27:53,847 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-11-18 10:27:53,847 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-11-18 10:27:53,847 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 10:27:53,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 165 transitions. [2018-11-18 10:27:53,848 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:53,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:53,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:53,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:53,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:53,850 INFO L794 eck$LassoCheckResult]: Stem: 6086#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6056#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 6057#L23-4 assume true; 6082#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6085#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6083#L23-4 assume true; 6071#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6072#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6119#L23-4 assume true; 6118#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6117#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6116#L23-4 assume true; 6115#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6114#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6113#L23-4 assume true; 6112#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6111#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6110#L23-4 assume true; 6109#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6108#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6107#L23-4 assume true; 6106#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6105#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6104#L23-4 assume true; 6103#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6102#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6101#L23-4 assume true; 6100#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6098#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6096#L23-4 assume true; 6092#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6093#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6091#L23-4 assume true; 6069#L23-1 assume !(main_~i~1 < 10); 6070#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; 6048#L9-4 assume true; 6049#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6063#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6064#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6052#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6050#L9-4 assume true; 6051#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6055#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6189#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6188#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6187#L9-4 assume true; 6186#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6185#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6184#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6183#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6182#L9-4 assume true; 6181#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6180#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6179#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6178#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6177#L9-4 assume true; 6176#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6175#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6174#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6173#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6172#L9-4 assume true; 6171#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6170#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6169#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6168#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6167#L9-4 assume true; 6166#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6165#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6164#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6163#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6162#L9-4 assume true; 6161#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6160#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6158#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6156#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6155#L9-4 assume true; 6089#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6122#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6120#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6090#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6088#L9-4 assume true; 6053#L9-1 assume !(max_~i~0 < 10); 6054#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 6073#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 6058#L9-10 assume true; 6059#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6074#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6081#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6065#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6066#L9-10 assume true; 6159#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6157#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6077#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6078#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6154#L9-10 assume true; 6153#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6152#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6151#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6150#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6149#L9-10 assume true; 6148#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6147#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6146#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6145#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6144#L9-10 assume true; 6143#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6142#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6141#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6140#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6139#L9-10 assume true; 6138#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6137#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6136#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6135#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6134#L9-10 assume true; 6133#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6132#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6131#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6130#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6129#L9-10 assume true; 6128#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6127#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6126#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6125#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6124#L9-10 assume true; 6123#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6095#L10-3 [2018-11-18 10:27:53,850 INFO L796 eck$LassoCheckResult]: Loop: 6095#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 6121#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6099#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6097#L9-10 assume true; 6094#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6095#L10-3 [2018-11-18 10:27:53,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2029392059, now seen corresponding path program 8 times [2018-11-18 10:27:53,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:53,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:53,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:53,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-18 10:27:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:27:53,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5adbf00c-f053-41ac-98ec-f47f5f9fb8ff/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-11-18 10:27:53,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:27:54,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:27:54,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:27:54,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:27:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-18 10:27:54,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:27:54,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 10:27:54,058 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:27:54,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 10 times [2018-11-18 10:27:54,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:54,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:27:54,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:27:54,103 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. cyclomatic complexity: 28 Second operand 13 states. [2018-11-18 10:27:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:54,189 INFO L93 Difference]: Finished difference Result 201 states and 235 transitions. [2018-11-18 10:27:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:27:54,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 235 transitions. [2018-11-18 10:27:54,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:54,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 200 states and 234 transitions. [2018-11-18 10:27:54,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-18 10:27:54,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2018-11-18 10:27:54,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 234 transitions. [2018-11-18 10:27:54,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:54,192 INFO L705 BuchiCegarLoop]: Abstraction has 200 states and 234 transitions. [2018-11-18 10:27:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 234 transitions. [2018-11-18 10:27:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-11-18 10:27:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 10:27:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2018-11-18 10:27:54,199 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 177 transitions. [2018-11-18 10:27:54,199 INFO L608 BuchiCegarLoop]: Abstraction has 152 states and 177 transitions. [2018-11-18 10:27:54,199 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 10:27:54,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 177 transitions. [2018-11-18 10:27:54,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:27:54,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:54,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:54,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:54,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:27:54,201 INFO L794 eck$LassoCheckResult]: Stem: 6821#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6795#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 6796#L23-4 assume true; 6804#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6805#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6816#L23-4 assume true; 6817#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6819#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6820#L23-4 assume true; 6872#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6870#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6868#L23-4 assume true; 6866#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6864#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6862#L23-4 assume true; 6860#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6858#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6856#L23-4 assume true; 6854#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6852#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6850#L23-4 assume true; 6848#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6846#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6844#L23-4 assume true; 6842#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6840#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6839#L23-4 assume true; 6837#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6835#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6833#L23-4 assume true; 6829#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 6830#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 6828#L23-4 assume true; 6802#L23-1 assume !(main_~i~1 < 10); 6803#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; 6782#L9-4 assume true; 6783#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6789#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6815#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6786#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6784#L9-4 assume true; 6785#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6797#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6798#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6933#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6932#L9-4 assume true; 6931#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6930#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6929#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6928#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6927#L9-4 assume true; 6926#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6925#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6924#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6923#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6922#L9-4 assume true; 6921#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6920#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6919#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6918#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6917#L9-4 assume true; 6916#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6915#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6914#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6913#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6912#L9-4 assume true; 6911#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6910#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6909#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6908#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6907#L9-4 assume true; 6906#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6905#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6904#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6903#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6902#L9-4 assume true; 6901#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6900#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6899#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6897#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6895#L9-4 assume true; 6824#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6827#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6826#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6825#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6823#L9-4 assume true; 6787#L9-1 assume !(max_~i~0 < 10); 6788#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 6806#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 6807#L9-10 assume true; 6898#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6896#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6811#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6799#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6790#L9-10 assume true; 6791#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6808#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6814#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6894#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6893#L9-10 assume true; 6892#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6891#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6890#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6889#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6888#L9-10 assume true; 6887#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6886#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6885#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6884#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6883#L9-10 assume true; 6882#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6881#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6880#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6879#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6878#L9-10 assume true; 6877#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6876#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6875#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6874#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6873#L9-10 assume true; 6871#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6869#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6867#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6865#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6863#L9-10 assume true; 6861#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6859#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6857#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6855#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6853#L9-10 assume true; 6851#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6849#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 6847#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6845#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6843#L9-10 assume true; 6841#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6832#L10-3 [2018-11-18 10:27:54,201 INFO L796 eck$LassoCheckResult]: Loop: 6832#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 6838#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 6836#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6834#L9-10 assume true; 6831#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 6832#L10-3 [2018-11-18 10:27:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1144127191, now seen corresponding path program 9 times [2018-11-18 10:27:54,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:54,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 11 times [2018-11-18 10:27:54,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:54,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:54,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:54,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:54,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1925642867, now seen corresponding path program 1 times [2018-11-18 10:27:54,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:27:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:27:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-18 10:27:54,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:27:54,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:27:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 10:27:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:27:54,760 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. cyclomatic complexity: 30 Second operand 15 states. [2018-11-18 10:27:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:27:54,966 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2018-11-18 10:27:54,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:27:54,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 231 transitions. [2018-11-18 10:27:54,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:27:54,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 146 states and 167 transitions. [2018-11-18 10:27:54,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-18 10:27:54,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-18 10:27:54,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 167 transitions. [2018-11-18 10:27:54,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:27:54,968 INFO L705 BuchiCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-11-18 10:27:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 167 transitions. [2018-11-18 10:27:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-18 10:27:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 10:27:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-11-18 10:27:54,970 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-11-18 10:27:54,970 INFO L608 BuchiCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-11-18 10:27:54,970 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-18 10:27:54,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 167 transitions. [2018-11-18 10:27:54,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:27:54,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:27:54,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:27:54,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:27:54,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:27:54,971 INFO L794 eck$LassoCheckResult]: Stem: 7201#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7198#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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 7190#L23-4 assume true; 7191#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7253#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7192#L23-4 assume true; 7193#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7196#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7197#L23-4 assume true; 7250#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7248#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7246#L23-4 assume true; 7244#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7242#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7240#L23-4 assume true; 7238#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7236#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7234#L23-4 assume true; 7232#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7230#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7228#L23-4 assume true; 7226#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7224#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7222#L23-4 assume true; 7220#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7218#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7216#L23-4 assume true; 7214#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7212#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7210#L23-4 assume true; 7207#L23-1 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 7208#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 7206#L23-4 assume true; 7203#L23-1 assume !(main_~i~1 < 10); 7184#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; 7185#L9-4 assume true; 7321#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7320#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7319#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7180#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7176#L9-4 assume true; 7177#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7187#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7188#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7189#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7318#L9-4 assume true; 7317#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7316#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7315#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7314#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7313#L9-4 assume true; 7312#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7311#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7310#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7309#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7308#L9-4 assume true; 7307#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7306#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7305#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7304#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7303#L9-4 assume true; 7302#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7301#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7300#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7299#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7298#L9-4 assume true; 7297#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7295#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7293#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7291#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7289#L9-4 assume true; 7287#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7285#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7283#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7281#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7279#L9-4 assume true; 7277#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7275#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7273#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7271#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7269#L9-4 assume true; 7267#L9-1 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7265#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7263#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7261#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7259#L9-4 assume true; 7257#L9-1 assume !(max_~i~0 < 10); 7205#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 7204#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 7199#L9-10 assume true; 7200#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7183#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7178#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7179#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7202#L9-10 assume true; 7296#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7294#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7292#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7290#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7288#L9-10 assume true; 7286#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7284#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7282#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7280#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7278#L9-10 assume true; 7276#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7274#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7272#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7270#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7268#L9-10 assume true; 7266#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7264#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7262#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7260#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7258#L9-10 assume true; 7256#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7255#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7254#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7252#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7251#L9-10 assume true; 7249#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7247#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7245#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7243#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7241#L9-10 assume true; 7239#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7237#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7235#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7233#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7231#L9-10 assume true; 7229#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7227#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7225#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7223#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7221#L9-10 assume true; 7219#L9-7 assume !!(max_~i~0 < 10);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 7217#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 7215#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 7213#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 7211#L9-10 assume true; 7209#L9-7 assume !(max_~i~0 < 10); 7194#L9-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 7195#L12-1 main_#t~ret9 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 7181#L32-4 [2018-11-18 10:27:54,972 INFO L796 eck$LassoCheckResult]: Loop: 7181#L32-4 assume true; 7182#L32-1 assume !!(main_~i~2 < 9);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 7186#L32-3 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 7181#L32-4 [2018-11-18 10:27:54,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1186898069, now seen corresponding path program 1 times [2018-11-18 10:27:54,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:54,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:55,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash 98470, now seen corresponding path program 1 times [2018-11-18 10:27:55,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:55,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:27:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1585305710, now seen corresponding path program 1 times [2018-11-18 10:27:55,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:27:55,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:27:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:27:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:27:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:27:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:28:15,151 WARN L180 SmtUtils]: Spent 19.68 s on a formula simplification. DAG size of input: 624 DAG size of output: 466 [2018-11-18 10:28:15,877 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2018-11-18 10:28:15,879 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:28:15,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:28:15,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:28:15,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:28:15,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:28:15,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:28:15,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:28:15,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:28:15,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: max10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-11-18 10:28:15,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:28:15,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:28:15,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:15,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,795 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 95 [2018-11-18 10:28:16,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:16,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:28:17,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:28:17,113 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:28:17,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:28:17,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:28:17,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:28:17,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:28:17,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:28:17,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:28:17,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:28:17,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:28:17,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:28:17,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:28:17,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:28:17,176 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:28:17,182 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:28:17,182 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:28:17,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:28:17,183 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:28:17,183 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:28:17,183 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2018-11-18 10:28:17,642 INFO L297 tatePredicateManager]: 138 out of 138 supporting invariants were superfluous and have been removed [2018-11-18 10:28:17,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:17,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:17,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:28:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:28:17,724 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:28:17,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 146 states and 167 transitions. cyclomatic complexity: 23 Second operand 4 states. [2018-11-18 10:28:17,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 146 states and 167 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 149 states and 171 transitions. Complement of second has 6 states. [2018-11-18 10:28:17,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:28:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:28:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-18 10:28:17,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 143 letters. Loop has 3 letters. [2018-11-18 10:28:17,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:28:17,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 146 letters. Loop has 3 letters. [2018-11-18 10:28:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:28:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 143 letters. Loop has 6 letters. [2018-11-18 10:28:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:28:17,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 171 transitions. [2018-11-18 10:28:17,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:28:17,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 0 states and 0 transitions. [2018-11-18 10:28:17,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:28:17,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:28:17,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:28:17,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:28:17,750 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:28:17,750 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:28:17,750 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:28:17,750 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 10:28:17,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:28:17,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:28:17,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:28:17,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:28:17 BoogieIcfgContainer [2018-11-18 10:28:17,756 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:28:17,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:28:17,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:28:17,757 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:28:17,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:27:45" (3/4) ... [2018-11-18 10:28:17,760 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:28:17,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:28:17,761 INFO L168 Benchmark]: Toolchain (without parser) took 32565.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -83.6 MB). Peak memory consumption was 206.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:17,761 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:28:17,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:17,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.23 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:28:17,762 INFO L168 Benchmark]: Boogie Preprocessor took 61.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:17,763 INFO L168 Benchmark]: RCFGBuilder took 249.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:17,763 INFO L168 Benchmark]: BuchiAutomizer took 32042.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.8 MB). Peak memory consumption was 219.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:17,764 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:28:17,766 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.23 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 249.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32042.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.8 MB). Peak memory consumption was 219.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[x] + -8 * i and consists of 5 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 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.0s and 25 iterations. TraceHistogramMax:11. Analysis of lassos took 30.3s. Construction of modules took 0.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 23. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 355 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 152 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 777 SDtfs, 1333 SDslu, 2680 SDs, 0 SdLazy, 1123 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf99 lsp95 ukn45 mio100 lsp53 div100 bol100 ite100 ukn100 eq170 hnf84 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 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...