java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partition_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:39:58,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:39:58,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:39:58,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:39:58,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:39:58,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:39:58,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:39:58,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:39:58,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:39:58,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:39:58,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:39:58,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:39:58,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:39:58,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:39:58,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:39:58,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:39:58,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:39:58,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:39:58,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:39:58,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:39:58,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:39:58,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:39:58,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:39:58,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:39:58,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:39:58,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:39:58,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:39:58,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:39:58,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:39:58,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:39:58,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:39:58,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:39:58,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:39:58,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:39:58,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:39:58,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:39:58,560 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:39:58,580 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:39:58,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:39:58,581 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:39:58,581 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:39:58,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:39:58,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:39:58,582 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:39:58,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:39:58,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:39:58,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:39:58,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:39:58,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:39:58,584 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:39:58,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:39:58,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:39:58,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:39:58,585 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:39:58,585 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:39:58,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:39:58,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:39:58,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:39:58,586 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:39:58,586 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:39:58,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:39:58,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:39:58,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:39:58,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:39:58,587 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:39:58,587 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:39:58,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:39:58,589 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:39:58,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:39:58,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:39:58,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:39:58,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:39:58,660 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:39:58,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_false-unreach-call_ground.i [2018-11-14 18:39:58,726 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b14e8856/867c01c19dd942289d10eed63de8b0e7/FLAG09867da0b [2018-11-14 18:39:59,190 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:39:59,190 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_false-unreach-call_ground.i [2018-11-14 18:39:59,198 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b14e8856/867c01c19dd942289d10eed63de8b0e7/FLAG09867da0b [2018-11-14 18:39:59,219 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b14e8856/867c01c19dd942289d10eed63de8b0e7 [2018-11-14 18:39:59,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:39:59,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:39:59,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:39:59,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:39:59,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:39:59,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65741394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59, skipping insertion in model container [2018-11-14 18:39:59,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:39:59,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:39:59,490 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:39:59,494 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:39:59,523 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:39:59,546 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:39:59,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59 WrapperNode [2018-11-14 18:39:59,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:39:59,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:39:59,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:39:59,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:39:59,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... [2018-11-14 18:39:59,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:39:59,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:39:59,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:39:59,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:39:59,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:39:59,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:39:59,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:39:59,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:39:59,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:39:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:39:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:40:00,430 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:40:00,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:40:00 BoogieIcfgContainer [2018-11-14 18:40:00,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:40:00,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:40:00,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:40:00,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:40:00,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:39:59" (1/3) ... [2018-11-14 18:40:00,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fddfb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:40:00, skipping insertion in model container [2018-11-14 18:40:00,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:59" (2/3) ... [2018-11-14 18:40:00,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fddfb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:40:00, skipping insertion in model container [2018-11-14 18:40:00,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:40:00" (3/3) ... [2018-11-14 18:40:00,440 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partition_false-unreach-call_ground.i [2018-11-14 18:40:00,450 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:40:00,458 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:40:00,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:40:00,510 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:40:00,511 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:40:00,511 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:40:00,511 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:40:00,511 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:40:00,511 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:40:00,512 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:40:00,512 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:40:00,512 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:40:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-14 18:40:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:40:00,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:00,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:00,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:00,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1664759166, now seen corresponding path program 1 times [2018-11-14 18:40:00,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:00,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:00,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:00,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:00,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-14 18:40:00,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-14 18:40:00,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-14 18:40:00,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #95#return; {41#true} is VALID [2018-11-14 18:40:00,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2018-11-14 18:40:00,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {41#true} is VALID [2018-11-14 18:40:00,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-14 18:40:00,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#false} ~a~0 := 0; {42#false} is VALID [2018-11-14 18:40:00,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-14 18:40:00,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} havoc ~x~0;~x~0 := 0; {42#false} is VALID [2018-11-14 18:40:00,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 18:40:00,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {42#false} is VALID [2018-11-14 18:40:00,731 INFO L256 TraceCheckUtils]: 12: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {42#false} is VALID [2018-11-14 18:40:00,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-14 18:40:00,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume ~cond == 0; {42#false} is VALID [2018-11-14 18:40:00,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-14 18:40:00,736 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-14 18:40:00,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:40:00,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:40:00,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:40:00,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:00,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:40:00,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:00,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:40:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:40:00,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:40:00,957 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-14 18:40:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:01,135 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-14 18:40:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:40:01,136 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:40:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:40:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-14 18:40:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:40:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-14 18:40:01,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2018-11-14 18:40:01,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:01,467 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:40:01,467 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:40:01,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:40:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:40:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 18:40:01,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:01,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 18:40:01,650 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:40:01,650 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:40:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:01,657 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 18:40:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:40:01,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:01,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:01,658 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:40:01,659 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:40:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:01,664 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 18:40:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:40:01,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:01,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:01,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:01,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:40:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-14 18:40:01,672 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 16 [2018-11-14 18:40:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:01,672 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-14 18:40:01,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:40:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:40:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:40:01,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:01,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:01,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:01,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1908524499, now seen corresponding path program 1 times [2018-11-14 18:40:01,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:01,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:01,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:01,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {238#true} is VALID [2018-11-14 18:40:01,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {238#true} is VALID [2018-11-14 18:40:01,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2018-11-14 18:40:01,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #95#return; {238#true} is VALID [2018-11-14 18:40:01,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret8 := main(); {238#true} is VALID [2018-11-14 18:40:01,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {238#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {240#(= main_~a~0 0)} is VALID [2018-11-14 18:40:01,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {240#(= main_~a~0 0)} assume true; {240#(= main_~a~0 0)} is VALID [2018-11-14 18:40:01,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {240#(= main_~a~0 0)} assume !(~a~0 < 100000); {239#false} is VALID [2018-11-14 18:40:01,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {239#false} ~a~0 := 0; {239#false} is VALID [2018-11-14 18:40:01,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {239#false} assume true; {239#false} is VALID [2018-11-14 18:40:01,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {239#false} assume !(~a~0 < 100000); {239#false} is VALID [2018-11-14 18:40:01,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {239#false} havoc ~x~0;~x~0 := 0; {239#false} is VALID [2018-11-14 18:40:01,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {239#false} assume true; {239#false} is VALID [2018-11-14 18:40:01,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {239#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {239#false} is VALID [2018-11-14 18:40:01,791 INFO L256 TraceCheckUtils]: 14: Hoare triple {239#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {239#false} is VALID [2018-11-14 18:40:01,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2018-11-14 18:40:01,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {239#false} assume ~cond == 0; {239#false} is VALID [2018-11-14 18:40:01,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {239#false} assume !false; {239#false} is VALID [2018-11-14 18:40:01,794 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-14 18:40:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:40:01,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:40:01,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:40:01,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:01,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:40:01,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:01,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:40:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:40:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:40:01,852 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-14 18:40:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:02,462 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-14 18:40:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:40:02,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:40:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:40:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 18:40:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:40:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 18:40:02,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-14 18:40:02,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:02,630 INFO L225 Difference]: With dead ends: 64 [2018-11-14 18:40:02,630 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 18:40:02,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:40:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 18:40:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-14 18:40:02,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:02,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 37 states. [2018-11-14 18:40:02,651 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 37 states. [2018-11-14 18:40:02,651 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 37 states. [2018-11-14 18:40:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:02,655 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-14 18:40:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-14 18:40:02,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:02,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:02,656 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 41 states. [2018-11-14 18:40:02,657 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 41 states. [2018-11-14 18:40:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:02,661 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-14 18:40:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-14 18:40:02,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:02,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:02,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:02,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:40:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-14 18:40:02,666 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 18 [2018-11-14 18:40:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:02,666 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-14 18:40:02,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:40:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-14 18:40:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:40:02,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:02,668 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:02,668 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:02,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2046552275, now seen corresponding path program 1 times [2018-11-14 18:40:02,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:02,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:02,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:02,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-14 18:40:02,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {458#true} is VALID [2018-11-14 18:40:02,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-14 18:40:02,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #95#return; {458#true} is VALID [2018-11-14 18:40:02,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret8 := main(); {458#true} is VALID [2018-11-14 18:40:02,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {460#(= main_~a~0 0)} is VALID [2018-11-14 18:40:02,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {460#(= main_~a~0 0)} assume true; {460#(= main_~a~0 0)} is VALID [2018-11-14 18:40:02,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {460#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {460#(= main_~a~0 0)} is VALID [2018-11-14 18:40:02,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {460#(= main_~a~0 0)} is VALID [2018-11-14 18:40:02,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {461#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:02,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#(<= main_~a~0 1)} assume true; {461#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:02,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#(<= main_~a~0 1)} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-14 18:40:02,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {459#false} ~a~0 := 0; {459#false} is VALID [2018-11-14 18:40:02,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-14 18:40:02,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {459#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {459#false} is VALID [2018-11-14 18:40:02,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {459#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {459#false} is VALID [2018-11-14 18:40:02,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {459#false} ~a~0 := ~a~0 + 1; {459#false} is VALID [2018-11-14 18:40:02,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-14 18:40:02,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {459#false} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-14 18:40:02,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {459#false} havoc ~x~0;~x~0 := 0; {459#false} is VALID [2018-11-14 18:40:02,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-14 18:40:02,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {459#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {459#false} is VALID [2018-11-14 18:40:02,871 INFO L256 TraceCheckUtils]: 22: Hoare triple {459#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {459#false} is VALID [2018-11-14 18:40:02,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {459#false} ~cond := #in~cond; {459#false} is VALID [2018-11-14 18:40:02,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {459#false} assume ~cond == 0; {459#false} is VALID [2018-11-14 18:40:02,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-14 18:40:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:40:02,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:02,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:02,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:03,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-14 18:40:03,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {458#true} is VALID [2018-11-14 18:40:03,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-14 18:40:03,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #95#return; {458#true} is VALID [2018-11-14 18:40:03,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret8 := main(); {458#true} is VALID [2018-11-14 18:40:03,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {480#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:03,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#(<= main_~a~0 0)} assume true; {480#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:03,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {480#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:03,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {480#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {480#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:03,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {480#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {461#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:03,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#(<= main_~a~0 1)} assume true; {461#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:03,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#(<= main_~a~0 1)} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-14 18:40:03,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {459#false} ~a~0 := 0; {459#false} is VALID [2018-11-14 18:40:03,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-14 18:40:03,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {459#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {459#false} is VALID [2018-11-14 18:40:03,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {459#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {459#false} is VALID [2018-11-14 18:40:03,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {459#false} ~a~0 := ~a~0 + 1; {459#false} is VALID [2018-11-14 18:40:03,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-14 18:40:03,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {459#false} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-14 18:40:03,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {459#false} havoc ~x~0;~x~0 := 0; {459#false} is VALID [2018-11-14 18:40:03,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-14 18:40:03,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {459#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {459#false} is VALID [2018-11-14 18:40:03,291 INFO L256 TraceCheckUtils]: 22: Hoare triple {459#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {459#false} is VALID [2018-11-14 18:40:03,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {459#false} ~cond := #in~cond; {459#false} is VALID [2018-11-14 18:40:03,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {459#false} assume ~cond == 0; {459#false} is VALID [2018-11-14 18:40:03,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-14 18:40:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:40:03,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:03,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:40:03,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:40:03,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:03,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:40:03,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:03,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:40:03,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:40:03,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:40:03,409 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2018-11-14 18:40:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:03,881 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 18:40:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:40:03,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:40:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:40:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2018-11-14 18:40:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:40:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2018-11-14 18:40:03,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2018-11-14 18:40:04,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:04,029 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:40:04,029 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:40:04,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:40:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:40:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-14 18:40:04,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:04,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-14 18:40:04,052 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-14 18:40:04,052 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-14 18:40:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:04,056 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-14 18:40:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-14 18:40:04,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:04,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:04,058 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-14 18:40:04,058 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-14 18:40:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:04,061 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-14 18:40:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-14 18:40:04,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:04,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:04,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:04,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:40:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-14 18:40:04,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 26 [2018-11-14 18:40:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-14 18:40:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:40:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-14 18:40:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:40:04,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:04,068 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:04,068 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:04,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1733295661, now seen corresponding path program 2 times [2018-11-14 18:40:04,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:04,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:04,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:04,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:04,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-14 18:40:04,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {794#true} is VALID [2018-11-14 18:40:04,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-14 18:40:04,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #95#return; {794#true} is VALID [2018-11-14 18:40:04,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret8 := main(); {794#true} is VALID [2018-11-14 18:40:04,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {796#(= main_~a~0 0)} is VALID [2018-11-14 18:40:04,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {796#(= main_~a~0 0)} assume true; {796#(= main_~a~0 0)} is VALID [2018-11-14 18:40:04,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {796#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {796#(= main_~a~0 0)} is VALID [2018-11-14 18:40:04,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {796#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {796#(= main_~a~0 0)} is VALID [2018-11-14 18:40:04,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {796#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {797#(<= main_~a~0 1)} assume true; {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {797#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {797#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {797#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {798#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:04,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {798#(<= main_~a~0 2)} assume true; {798#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:04,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {798#(<= main_~a~0 2)} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-14 18:40:04,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#false} ~a~0 := 0; {795#false} is VALID [2018-11-14 18:40:04,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {795#false} is VALID [2018-11-14 18:40:04,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {795#false} ~a~0 := ~a~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {795#false} is VALID [2018-11-14 18:40:04,227 INFO L273 TraceCheckUtils]: 23: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {795#false} ~a~0 := ~a~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {795#false} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-14 18:40:04,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {795#false} havoc ~x~0;~x~0 := 0; {795#false} is VALID [2018-11-14 18:40:04,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {795#false} is VALID [2018-11-14 18:40:04,229 INFO L256 TraceCheckUtils]: 30: Hoare triple {795#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {795#false} is VALID [2018-11-14 18:40:04,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2018-11-14 18:40:04,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {795#false} assume ~cond == 0; {795#false} is VALID [2018-11-14 18:40:04,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-14 18:40:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:40:04,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:04,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:04,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:40:04,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:40:04,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:04,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:04,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-14 18:40:04,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {794#true} is VALID [2018-11-14 18:40:04,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-14 18:40:04,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #95#return; {794#true} is VALID [2018-11-14 18:40:04,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret8 := main(); {794#true} is VALID [2018-11-14 18:40:04,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:04,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {817#(<= main_~a~0 0)} assume true; {817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:04,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {817#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:04,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {817#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:04,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {817#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {797#(<= main_~a~0 1)} assume true; {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {797#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {797#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {797#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:04,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {797#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {798#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:04,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {798#(<= main_~a~0 2)} assume true; {798#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:04,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {798#(<= main_~a~0 2)} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-14 18:40:04,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#false} ~a~0 := 0; {795#false} is VALID [2018-11-14 18:40:04,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {795#false} is VALID [2018-11-14 18:40:04,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {795#false} ~a~0 := ~a~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {795#false} is VALID [2018-11-14 18:40:04,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {795#false} ~a~0 := ~a~0 + 1; {795#false} is VALID [2018-11-14 18:40:04,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {795#false} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-14 18:40:04,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {795#false} havoc ~x~0;~x~0 := 0; {795#false} is VALID [2018-11-14 18:40:04,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-14 18:40:04,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {795#false} is VALID [2018-11-14 18:40:04,529 INFO L256 TraceCheckUtils]: 30: Hoare triple {795#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {795#false} is VALID [2018-11-14 18:40:04,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2018-11-14 18:40:04,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {795#false} assume ~cond == 0; {795#false} is VALID [2018-11-14 18:40:04,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-14 18:40:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:40:04,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:04,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:40:04,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 18:40:04,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:04,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:40:04,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:04,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:40:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:40:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:40:04,619 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 6 states. [2018-11-14 18:40:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:04,978 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-14 18:40:04,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:40:04,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 18:40:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:40:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-14 18:40:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:40:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-14 18:40:04,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2018-11-14 18:40:05,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:05,201 INFO L225 Difference]: With dead ends: 86 [2018-11-14 18:40:05,201 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:40:05,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:40:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:40:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-14 18:40:05,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:05,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-14 18:40:05,234 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-14 18:40:05,235 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-14 18:40:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:05,238 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-14 18:40:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-14 18:40:05,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:05,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:05,239 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-14 18:40:05,239 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-14 18:40:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:05,243 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-14 18:40:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-14 18:40:05,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:05,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:05,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:05,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:40:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-14 18:40:05,248 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 34 [2018-11-14 18:40:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:05,248 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-14 18:40:05,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:40:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-14 18:40:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:40:05,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:05,250 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:05,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:05,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash 203231443, now seen corresponding path program 3 times [2018-11-14 18:40:05,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:05,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:05,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:05,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2018-11-14 18:40:05,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1196#true} is VALID [2018-11-14 18:40:05,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:40:05,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #95#return; {1196#true} is VALID [2018-11-14 18:40:05,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret8 := main(); {1196#true} is VALID [2018-11-14 18:40:05,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {1196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:05,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {1198#(= main_~a~0 0)} assume true; {1198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:05,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {1198#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:05,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:05,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {1198#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {1199#(<= main_~a~0 1)} assume true; {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {1199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {1199#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {1199#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#(<= main_~a~0 2)} assume true; {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {1201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:05,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {1201#(<= main_~a~0 3)} assume true; {1201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:05,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {1201#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1197#false} is VALID [2018-11-14 18:40:05,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {1197#false} ~a~0 := 0; {1197#false} is VALID [2018-11-14 18:40:05,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-14 18:40:05,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {1197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:40:05,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {1197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1197#false} is VALID [2018-11-14 18:40:05,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {1197#false} ~a~0 := ~a~0 + 1; {1197#false} is VALID [2018-11-14 18:40:05,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-14 18:40:05,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:40:05,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {1197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1197#false} is VALID [2018-11-14 18:40:05,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {1197#false} ~a~0 := ~a~0 + 1; {1197#false} is VALID [2018-11-14 18:40:05,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-14 18:40:05,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:40:05,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1197#false} is VALID [2018-11-14 18:40:05,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#false} ~a~0 := ~a~0 + 1; {1197#false} is VALID [2018-11-14 18:40:05,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-14 18:40:05,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {1197#false} assume !(~a~0 < 100000); {1197#false} is VALID [2018-11-14 18:40:05,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#false} havoc ~x~0;~x~0 := 0; {1197#false} is VALID [2018-11-14 18:40:05,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-14 18:40:05,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:40:05,412 INFO L256 TraceCheckUtils]: 38: Hoare triple {1197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1197#false} is VALID [2018-11-14 18:40:05,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {1197#false} ~cond := #in~cond; {1197#false} is VALID [2018-11-14 18:40:05,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {1197#false} assume ~cond == 0; {1197#false} is VALID [2018-11-14 18:40:05,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2018-11-14 18:40:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:40:05,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:05,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:40:05,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:40:05,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:05,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:05,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2018-11-14 18:40:05,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1196#true} is VALID [2018-11-14 18:40:05,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:40:05,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #95#return; {1196#true} is VALID [2018-11-14 18:40:05,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret8 := main(); {1196#true} is VALID [2018-11-14 18:40:05,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {1196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1196#true} is VALID [2018-11-14 18:40:05,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:40:05,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {1196#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1196#true} is VALID [2018-11-14 18:40:05,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {1196#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1196#true} is VALID [2018-11-14 18:40:05,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#true} ~a~0 := ~a~0 + 1; {1196#true} is VALID [2018-11-14 18:40:05,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:40:05,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1196#true} is VALID [2018-11-14 18:40:05,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1196#true} is VALID [2018-11-14 18:40:05,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {1196#true} ~a~0 := ~a~0 + 1; {1196#true} is VALID [2018-11-14 18:40:05,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:40:05,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {1196#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1196#true} is VALID [2018-11-14 18:40:05,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {1196#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1196#true} is VALID [2018-11-14 18:40:05,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {1196#true} ~a~0 := ~a~0 + 1; {1196#true} is VALID [2018-11-14 18:40:05,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-14 18:40:05,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {1196#true} assume !(~a~0 < 100000); {1196#true} is VALID [2018-11-14 18:40:05,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {1196#true} ~a~0 := 0; {1265#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:05,598 INFO L273 TraceCheckUtils]: 21: Hoare triple {1265#(<= main_~a~0 0)} assume true; {1265#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:05,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {1265#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1265#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:05,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {1265#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1265#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:05,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {1265#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {1199#(<= main_~a~0 1)} assume true; {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {1199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {1199#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:05,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {1199#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {1200#(<= main_~a~0 2)} assume true; {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {1200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {1200#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:05,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {1200#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {1201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:05,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {1201#(<= main_~a~0 3)} assume true; {1201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:05,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {1201#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1197#false} is VALID [2018-11-14 18:40:05,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#false} havoc ~x~0;~x~0 := 0; {1197#false} is VALID [2018-11-14 18:40:05,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-14 18:40:05,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {1197#false} is VALID [2018-11-14 18:40:05,623 INFO L256 TraceCheckUtils]: 38: Hoare triple {1197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1197#false} is VALID [2018-11-14 18:40:05,623 INFO L273 TraceCheckUtils]: 39: Hoare triple {1197#false} ~cond := #in~cond; {1197#false} is VALID [2018-11-14 18:40:05,623 INFO L273 TraceCheckUtils]: 40: Hoare triple {1197#false} assume ~cond == 0; {1197#false} is VALID [2018-11-14 18:40:05,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2018-11-14 18:40:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:40:05,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:05,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:40:05,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-14 18:40:05,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:05,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:40:05,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:05,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:40:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:40:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:40:05,718 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 7 states. [2018-11-14 18:40:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:05,963 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-11-14 18:40:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:40:05,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-14 18:40:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:40:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2018-11-14 18:40:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:40:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2018-11-14 18:40:05,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2018-11-14 18:40:06,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:06,131 INFO L225 Difference]: With dead ends: 98 [2018-11-14 18:40:06,131 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 18:40:06,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:40:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 18:40:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-11-14 18:40:06,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:06,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 61 states. [2018-11-14 18:40:06,197 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 61 states. [2018-11-14 18:40:06,197 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 61 states. [2018-11-14 18:40:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:06,200 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 18:40:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-14 18:40:06,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:06,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:06,201 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 65 states. [2018-11-14 18:40:06,202 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 65 states. [2018-11-14 18:40:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:06,209 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 18:40:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-14 18:40:06,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:06,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:06,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:06,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 18:40:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-11-14 18:40:06,217 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 42 [2018-11-14 18:40:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:06,218 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-11-14 18:40:06,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:40:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-11-14 18:40:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 18:40:06,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:06,220 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:06,220 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:06,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 285349331, now seen corresponding path program 4 times [2018-11-14 18:40:06,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:06,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:06,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:06,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:06,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:06,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2018-11-14 18:40:06,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {1664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1664#true} is VALID [2018-11-14 18:40:06,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2018-11-14 18:40:06,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #95#return; {1664#true} is VALID [2018-11-14 18:40:06,374 INFO L256 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret8 := main(); {1664#true} is VALID [2018-11-14 18:40:06,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {1664#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1666#(= main_~a~0 0)} is VALID [2018-11-14 18:40:06,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {1666#(= main_~a~0 0)} assume true; {1666#(= main_~a~0 0)} is VALID [2018-11-14 18:40:06,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {1666#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1666#(= main_~a~0 0)} is VALID [2018-11-14 18:40:06,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {1666#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1666#(= main_~a~0 0)} is VALID [2018-11-14 18:40:06,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {1666#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {1667#(<= main_~a~0 1)} assume true; {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {1667#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {1667#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {1667#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(<= main_~a~0 2)} assume true; {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~a~0 3)} assume true; {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {1669#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {1670#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:06,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {1670#(<= main_~a~0 4)} assume true; {1670#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:06,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {1670#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-14 18:40:06,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {1665#false} ~a~0 := 0; {1665#false} is VALID [2018-11-14 18:40:06,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,400 INFO L273 TraceCheckUtils]: 32: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,402 INFO L273 TraceCheckUtils]: 39: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,402 INFO L273 TraceCheckUtils]: 42: Hoare triple {1665#false} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-14 18:40:06,402 INFO L273 TraceCheckUtils]: 43: Hoare triple {1665#false} havoc ~x~0;~x~0 := 0; {1665#false} is VALID [2018-11-14 18:40:06,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {1665#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,403 INFO L256 TraceCheckUtils]: 46: Hoare triple {1665#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1665#false} is VALID [2018-11-14 18:40:06,403 INFO L273 TraceCheckUtils]: 47: Hoare triple {1665#false} ~cond := #in~cond; {1665#false} is VALID [2018-11-14 18:40:06,403 INFO L273 TraceCheckUtils]: 48: Hoare triple {1665#false} assume ~cond == 0; {1665#false} is VALID [2018-11-14 18:40:06,404 INFO L273 TraceCheckUtils]: 49: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2018-11-14 18:40:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 18:40:06,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:06,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:06,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:40:06,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:40:06,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:06,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:06,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2018-11-14 18:40:06,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {1664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1664#true} is VALID [2018-11-14 18:40:06,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2018-11-14 18:40:06,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #95#return; {1664#true} is VALID [2018-11-14 18:40:06,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret8 := main(); {1664#true} is VALID [2018-11-14 18:40:06,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {1664#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1689#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:06,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(<= main_~a~0 0)} assume true; {1689#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:06,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {1689#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1689#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:06,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {1689#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1689#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:06,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {1689#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {1667#(<= main_~a~0 1)} assume true; {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {1667#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {1667#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1667#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:06,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {1667#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(<= main_~a~0 2)} assume true; {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1668#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:06,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~a~0 3)} assume true; {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {1669#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:06,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {1669#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {1670#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:06,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {1670#(<= main_~a~0 4)} assume true; {1670#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:06,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {1670#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-14 18:40:06,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {1665#false} ~a~0 := 0; {1665#false} is VALID [2018-11-14 18:40:06,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,807 INFO L273 TraceCheckUtils]: 31: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,807 INFO L273 TraceCheckUtils]: 32: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,809 INFO L273 TraceCheckUtils]: 38: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,809 INFO L273 TraceCheckUtils]: 40: Hoare triple {1665#false} ~a~0 := ~a~0 + 1; {1665#false} is VALID [2018-11-14 18:40:06,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {1665#false} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-14 18:40:06,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {1665#false} havoc ~x~0;~x~0 := 0; {1665#false} is VALID [2018-11-14 18:40:06,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-14 18:40:06,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {1665#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {1665#false} is VALID [2018-11-14 18:40:06,810 INFO L256 TraceCheckUtils]: 46: Hoare triple {1665#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1665#false} is VALID [2018-11-14 18:40:06,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {1665#false} ~cond := #in~cond; {1665#false} is VALID [2018-11-14 18:40:06,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {1665#false} assume ~cond == 0; {1665#false} is VALID [2018-11-14 18:40:06,811 INFO L273 TraceCheckUtils]: 49: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2018-11-14 18:40:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 18:40:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:06,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:40:06,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-14 18:40:06,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:06,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:40:06,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:06,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:40:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:40:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:40:06,912 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 8 states. [2018-11-14 18:40:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:07,317 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2018-11-14 18:40:07,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:40:07,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-14 18:40:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:40:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2018-11-14 18:40:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:40:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2018-11-14 18:40:07,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 118 transitions. [2018-11-14 18:40:07,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:07,501 INFO L225 Difference]: With dead ends: 110 [2018-11-14 18:40:07,501 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 18:40:07,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:40:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 18:40:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-14 18:40:07,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:07,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 69 states. [2018-11-14 18:40:07,542 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 69 states. [2018-11-14 18:40:07,542 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 69 states. [2018-11-14 18:40:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:07,546 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-14 18:40:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-14 18:40:07,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:07,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:07,547 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 73 states. [2018-11-14 18:40:07,547 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 73 states. [2018-11-14 18:40:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:07,550 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-14 18:40:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-14 18:40:07,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:07,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:07,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:07,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 18:40:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-11-14 18:40:07,555 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 50 [2018-11-14 18:40:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:07,555 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-11-14 18:40:07,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:40:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-11-14 18:40:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:40:07,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:07,557 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:07,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:07,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1566699309, now seen corresponding path program 5 times [2018-11-14 18:40:07,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:07,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:07,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2018-11-14 18:40:07,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {2198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2198#true} is VALID [2018-11-14 18:40:07,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:07,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #95#return; {2198#true} is VALID [2018-11-14 18:40:07,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret8 := main(); {2198#true} is VALID [2018-11-14 18:40:07,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {2198#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2200#(= main_~a~0 0)} is VALID [2018-11-14 18:40:07,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {2200#(= main_~a~0 0)} assume true; {2200#(= main_~a~0 0)} is VALID [2018-11-14 18:40:07,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {2200#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2200#(= main_~a~0 0)} is VALID [2018-11-14 18:40:07,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {2200#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2200#(= main_~a~0 0)} is VALID [2018-11-14 18:40:07,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:07,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {2201#(<= main_~a~0 1)} assume true; {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:07,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {2201#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:07,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {2201#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:07,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {2201#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:07,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {2202#(<= main_~a~0 2)} assume true; {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:07,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {2202#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:07,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {2202#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:07,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {2202#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:07,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {2203#(<= main_~a~0 3)} assume true; {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:07,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {2203#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:07,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {2203#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:07,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {2203#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:07,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {2204#(<= main_~a~0 4)} assume true; {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:07,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {2204#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:07,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {2204#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:07,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {2204#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {2205#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:07,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {2205#(<= main_~a~0 5)} assume true; {2205#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:07,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {2205#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2199#false} is VALID [2018-11-14 18:40:07,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {2199#false} ~a~0 := 0; {2199#false} is VALID [2018-11-14 18:40:07,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:07,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {2199#false} ~a~0 := ~a~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:07,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {2199#false} ~a~0 := ~a~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:07,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {2199#false} ~a~0 := ~a~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:07,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {2199#false} ~a~0 := ~a~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:07,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {2199#false} ~a~0 := ~a~0 + 1; {2199#false} is VALID [2018-11-14 18:40:07,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {2199#false} assume !(~a~0 < 100000); {2199#false} is VALID [2018-11-14 18:40:07,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {2199#false} havoc ~x~0;~x~0 := 0; {2199#false} is VALID [2018-11-14 18:40:07,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:07,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {2199#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:07,968 INFO L256 TraceCheckUtils]: 54: Hoare triple {2199#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2199#false} is VALID [2018-11-14 18:40:07,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2018-11-14 18:40:07,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {2199#false} assume ~cond == 0; {2199#false} is VALID [2018-11-14 18:40:07,969 INFO L273 TraceCheckUtils]: 57: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2018-11-14 18:40:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-14 18:40:07,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:07,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:07,988 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:40:08,187 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:40:08,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:08,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:08,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2018-11-14 18:40:08,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {2198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2198#true} is VALID [2018-11-14 18:40:08,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #95#return; {2198#true} is VALID [2018-11-14 18:40:08,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret8 := main(); {2198#true} is VALID [2018-11-14 18:40:08,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {2198#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {2198#true} ~a~0 := ~a~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2198#true} is VALID [2018-11-14 18:40:08,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {2198#true} ~a~0 := ~a~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {2198#true} ~a~0 := ~a~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {2198#true} ~a~0 := ~a~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {2198#true} ~a~0 := ~a~0 + 1; {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-14 18:40:08,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#true} assume !(~a~0 < 100000); {2198#true} is VALID [2018-11-14 18:40:08,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#true} ~a~0 := 0; {2293#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:08,559 INFO L273 TraceCheckUtils]: 29: Hoare triple {2293#(<= main_~a~0 0)} assume true; {2293#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:08,559 INFO L273 TraceCheckUtils]: 30: Hoare triple {2293#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2293#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:08,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2293#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:08,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {2293#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:08,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {2201#(<= main_~a~0 1)} assume true; {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:08,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {2201#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:08,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {2201#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2201#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:08,569 INFO L273 TraceCheckUtils]: 36: Hoare triple {2201#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:08,569 INFO L273 TraceCheckUtils]: 37: Hoare triple {2202#(<= main_~a~0 2)} assume true; {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:08,570 INFO L273 TraceCheckUtils]: 38: Hoare triple {2202#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:08,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {2202#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2202#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:08,570 INFO L273 TraceCheckUtils]: 40: Hoare triple {2202#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:08,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {2203#(<= main_~a~0 3)} assume true; {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:08,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {2203#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:08,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {2203#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2203#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:08,572 INFO L273 TraceCheckUtils]: 44: Hoare triple {2203#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:08,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {2204#(<= main_~a~0 4)} assume true; {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:08,573 INFO L273 TraceCheckUtils]: 46: Hoare triple {2204#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:08,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {2204#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2204#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:08,574 INFO L273 TraceCheckUtils]: 48: Hoare triple {2204#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {2205#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:08,575 INFO L273 TraceCheckUtils]: 49: Hoare triple {2205#(<= main_~a~0 5)} assume true; {2205#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:08,575 INFO L273 TraceCheckUtils]: 50: Hoare triple {2205#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2199#false} is VALID [2018-11-14 18:40:08,576 INFO L273 TraceCheckUtils]: 51: Hoare triple {2199#false} havoc ~x~0;~x~0 := 0; {2199#false} is VALID [2018-11-14 18:40:08,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-14 18:40:08,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {2199#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {2199#false} is VALID [2018-11-14 18:40:08,576 INFO L256 TraceCheckUtils]: 54: Hoare triple {2199#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2199#false} is VALID [2018-11-14 18:40:08,577 INFO L273 TraceCheckUtils]: 55: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2018-11-14 18:40:08,577 INFO L273 TraceCheckUtils]: 56: Hoare triple {2199#false} assume ~cond == 0; {2199#false} is VALID [2018-11-14 18:40:08,577 INFO L273 TraceCheckUtils]: 57: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2018-11-14 18:40:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-14 18:40:08,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:08,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 18:40:08,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-14 18:40:08,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:08,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:40:08,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:08,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:40:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:40:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:40:08,714 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-11-14 18:40:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:09,285 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-11-14 18:40:09,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:40:09,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-14 18:40:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:40:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-14 18:40:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:40:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-14 18:40:09,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 128 transitions. [2018-11-14 18:40:09,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:09,420 INFO L225 Difference]: With dead ends: 122 [2018-11-14 18:40:09,420 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 18:40:09,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:40:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 18:40:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-11-14 18:40:09,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:09,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 77 states. [2018-11-14 18:40:09,471 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 77 states. [2018-11-14 18:40:09,471 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 77 states. [2018-11-14 18:40:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:09,474 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2018-11-14 18:40:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-11-14 18:40:09,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:09,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:09,475 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 81 states. [2018-11-14 18:40:09,475 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 81 states. [2018-11-14 18:40:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:09,478 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2018-11-14 18:40:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-11-14 18:40:09,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:09,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:09,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:09,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:40:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-14 18:40:09,482 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 58 [2018-11-14 18:40:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:09,482 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-14 18:40:09,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:40:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-14 18:40:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 18:40:09,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:09,483 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:09,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:09,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 984613331, now seen corresponding path program 6 times [2018-11-14 18:40:09,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:09,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:09,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:09,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {2798#true} call ULTIMATE.init(); {2798#true} is VALID [2018-11-14 18:40:09,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {2798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2798#true} is VALID [2018-11-14 18:40:09,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:09,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2798#true} {2798#true} #95#return; {2798#true} is VALID [2018-11-14 18:40:09,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {2798#true} call #t~ret8 := main(); {2798#true} is VALID [2018-11-14 18:40:09,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {2798#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2800#(= main_~a~0 0)} is VALID [2018-11-14 18:40:09,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {2800#(= main_~a~0 0)} assume true; {2800#(= main_~a~0 0)} is VALID [2018-11-14 18:40:09,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {2800#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2800#(= main_~a~0 0)} is VALID [2018-11-14 18:40:09,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {2800#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2800#(= main_~a~0 0)} is VALID [2018-11-14 18:40:09,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {2800#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:09,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {2801#(<= main_~a~0 1)} assume true; {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:09,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {2801#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:09,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {2801#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:09,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {2801#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:09,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {2802#(<= main_~a~0 2)} assume true; {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:09,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {2802#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:09,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {2802#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:09,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {2802#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:09,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {2803#(<= main_~a~0 3)} assume true; {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:09,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {2803#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:09,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {2803#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:09,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {2803#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:09,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {2804#(<= main_~a~0 4)} assume true; {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:09,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {2804#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:09,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {2804#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:09,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:09,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {2805#(<= main_~a~0 5)} assume true; {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:09,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {2805#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:09,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {2805#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:09,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {2805#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {2806#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:09,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {2806#(<= main_~a~0 6)} assume true; {2806#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:09,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {2806#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2799#false} is VALID [2018-11-14 18:40:09,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {2799#false} ~a~0 := 0; {2799#false} is VALID [2018-11-14 18:40:09,771 INFO L273 TraceCheckUtils]: 33: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,772 INFO L273 TraceCheckUtils]: 36: Hoare triple {2799#false} ~a~0 := ~a~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,772 INFO L273 TraceCheckUtils]: 39: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {2799#false} ~a~0 := ~a~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {2799#false} ~a~0 := ~a~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {2799#false} ~a~0 := ~a~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,775 INFO L273 TraceCheckUtils]: 52: Hoare triple {2799#false} ~a~0 := ~a~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,775 INFO L273 TraceCheckUtils]: 53: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,775 INFO L273 TraceCheckUtils]: 54: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,775 INFO L273 TraceCheckUtils]: 55: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,775 INFO L273 TraceCheckUtils]: 56: Hoare triple {2799#false} ~a~0 := ~a~0 + 1; {2799#false} is VALID [2018-11-14 18:40:09,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,777 INFO L273 TraceCheckUtils]: 58: Hoare triple {2799#false} assume !(~a~0 < 100000); {2799#false} is VALID [2018-11-14 18:40:09,777 INFO L273 TraceCheckUtils]: 59: Hoare triple {2799#false} havoc ~x~0;~x~0 := 0; {2799#false} is VALID [2018-11-14 18:40:09,777 INFO L273 TraceCheckUtils]: 60: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:09,777 INFO L273 TraceCheckUtils]: 61: Hoare triple {2799#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:09,777 INFO L256 TraceCheckUtils]: 62: Hoare triple {2799#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2799#false} is VALID [2018-11-14 18:40:09,778 INFO L273 TraceCheckUtils]: 63: Hoare triple {2799#false} ~cond := #in~cond; {2799#false} is VALID [2018-11-14 18:40:09,778 INFO L273 TraceCheckUtils]: 64: Hoare triple {2799#false} assume ~cond == 0; {2799#false} is VALID [2018-11-14 18:40:09,778 INFO L273 TraceCheckUtils]: 65: Hoare triple {2799#false} assume !false; {2799#false} is VALID [2018-11-14 18:40:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:40:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:09,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:09,795 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:40:09,912 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:40:09,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:09,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:10,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {2798#true} call ULTIMATE.init(); {2798#true} is VALID [2018-11-14 18:40:10,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {2798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2798#true} is VALID [2018-11-14 18:40:10,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2798#true} {2798#true} #95#return; {2798#true} is VALID [2018-11-14 18:40:10,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {2798#true} call #t~ret8 := main(); {2798#true} is VALID [2018-11-14 18:40:10,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {2798#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2798#true} is VALID [2018-11-14 18:40:10,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2798#true} is VALID [2018-11-14 18:40:10,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {2798#true} ~a~0 := ~a~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {2798#true} ~a~0 := ~a~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2798#true} is VALID [2018-11-14 18:40:10,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {2798#true} ~a~0 := ~a~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2798#true} is VALID [2018-11-14 18:40:10,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {2798#true} ~a~0 := ~a~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,289 INFO L273 TraceCheckUtils]: 23: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2798#true} is VALID [2018-11-14 18:40:10,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {2798#true} ~a~0 := ~a~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2798#true} is VALID [2018-11-14 18:40:10,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {2798#true} ~a~0 := ~a~0 + 1; {2798#true} is VALID [2018-11-14 18:40:10,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-14 18:40:10,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {2798#true} assume !(~a~0 < 100000); {2798#true} is VALID [2018-11-14 18:40:10,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {2798#true} ~a~0 := 0; {2906#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:10,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {2906#(<= main_~a~0 0)} assume true; {2906#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:10,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {2906#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2906#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:10,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {2906#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2906#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:10,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {2906#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:10,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {2801#(<= main_~a~0 1)} assume true; {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:10,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {2801#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:10,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {2801#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2801#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:10,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {2801#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:10,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {2802#(<= main_~a~0 2)} assume true; {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:10,306 INFO L273 TraceCheckUtils]: 42: Hoare triple {2802#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:10,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {2802#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2802#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:10,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {2802#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:10,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {2803#(<= main_~a~0 3)} assume true; {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:10,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {2803#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:10,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {2803#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2803#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:10,314 INFO L273 TraceCheckUtils]: 48: Hoare triple {2803#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:10,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {2804#(<= main_~a~0 4)} assume true; {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:10,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {2804#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:10,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {2804#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2804#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:10,319 INFO L273 TraceCheckUtils]: 52: Hoare triple {2804#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:10,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {2805#(<= main_~a~0 5)} assume true; {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:10,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {2805#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:10,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {2805#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {2805#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:10,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {2805#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {2806#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:10,326 INFO L273 TraceCheckUtils]: 57: Hoare triple {2806#(<= main_~a~0 6)} assume true; {2806#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:10,326 INFO L273 TraceCheckUtils]: 58: Hoare triple {2806#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2799#false} is VALID [2018-11-14 18:40:10,326 INFO L273 TraceCheckUtils]: 59: Hoare triple {2799#false} havoc ~x~0;~x~0 := 0; {2799#false} is VALID [2018-11-14 18:40:10,326 INFO L273 TraceCheckUtils]: 60: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-14 18:40:10,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {2799#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {2799#false} is VALID [2018-11-14 18:40:10,327 INFO L256 TraceCheckUtils]: 62: Hoare triple {2799#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2799#false} is VALID [2018-11-14 18:40:10,327 INFO L273 TraceCheckUtils]: 63: Hoare triple {2799#false} ~cond := #in~cond; {2799#false} is VALID [2018-11-14 18:40:10,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {2799#false} assume ~cond == 0; {2799#false} is VALID [2018-11-14 18:40:10,327 INFO L273 TraceCheckUtils]: 65: Hoare triple {2799#false} assume !false; {2799#false} is VALID [2018-11-14 18:40:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-14 18:40:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:10,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:40:10,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-14 18:40:10,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:10,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:40:10,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:10,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:40:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:40:10,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:40:10,476 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 10 states. [2018-11-14 18:40:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:11,312 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2018-11-14 18:40:11,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:40:11,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-14 18:40:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:40:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2018-11-14 18:40:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:40:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2018-11-14 18:40:11,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 138 transitions. [2018-11-14 18:40:11,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:11,500 INFO L225 Difference]: With dead ends: 134 [2018-11-14 18:40:11,500 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 18:40:11,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:40:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 18:40:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-11-14 18:40:11,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:11,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2018-11-14 18:40:11,531 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2018-11-14 18:40:11,532 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2018-11-14 18:40:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:11,535 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-11-14 18:40:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2018-11-14 18:40:11,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:11,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:11,536 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2018-11-14 18:40:11,536 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2018-11-14 18:40:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:11,539 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-11-14 18:40:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2018-11-14 18:40:11,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:11,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:11,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:11,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-14 18:40:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2018-11-14 18:40:11,543 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 66 [2018-11-14 18:40:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:11,543 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2018-11-14 18:40:11,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:40:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2018-11-14 18:40:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 18:40:11,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:11,544 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:11,545 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:11,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1854478125, now seen corresponding path program 7 times [2018-11-14 18:40:11,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:11,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:11,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3464#true} is VALID [2018-11-14 18:40:11,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {3464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3464#true} is VALID [2018-11-14 18:40:11,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2018-11-14 18:40:11,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #95#return; {3464#true} is VALID [2018-11-14 18:40:11,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret8 := main(); {3464#true} is VALID [2018-11-14 18:40:11,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {3464#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {3466#(= main_~a~0 0)} is VALID [2018-11-14 18:40:11,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {3466#(= main_~a~0 0)} assume true; {3466#(= main_~a~0 0)} is VALID [2018-11-14 18:40:11,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3466#(= main_~a~0 0)} is VALID [2018-11-14 18:40:11,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {3466#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3466#(= main_~a~0 0)} is VALID [2018-11-14 18:40:11,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {3466#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:11,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {3467#(<= main_~a~0 1)} assume true; {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:11,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {3467#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:11,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {3467#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:11,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {3467#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:11,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {3468#(<= main_~a~0 2)} assume true; {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:11,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {3468#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:11,897 INFO L273 TraceCheckUtils]: 16: Hoare triple {3468#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:11,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {3468#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:11,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {3469#(<= main_~a~0 3)} assume true; {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:11,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {3469#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:11,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {3469#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:11,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {3469#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:11,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {3470#(<= main_~a~0 4)} assume true; {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:11,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {3470#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:11,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {3470#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:11,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {3470#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:11,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {3471#(<= main_~a~0 5)} assume true; {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:11,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:11,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {3471#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:11,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:11,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {3472#(<= main_~a~0 6)} assume true; {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:11,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {3472#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:11,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {3472#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:11,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {3472#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {3473#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:11,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#(<= main_~a~0 7)} assume true; {3473#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:11,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-14 18:40:11,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {3465#false} ~a~0 := 0; {3465#false} is VALID [2018-11-14 18:40:11,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,911 INFO L273 TraceCheckUtils]: 46: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 48: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 49: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 50: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 51: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,912 INFO L273 TraceCheckUtils]: 54: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 56: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 57: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 58: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 59: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 60: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 61: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,913 INFO L273 TraceCheckUtils]: 62: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 63: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 64: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 65: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {3465#false} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 67: Hoare triple {3465#false} havoc ~x~0;~x~0 := 0; {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 68: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {3465#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:11,914 INFO L256 TraceCheckUtils]: 70: Hoare triple {3465#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {3465#false} is VALID [2018-11-14 18:40:11,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {3465#false} ~cond := #in~cond; {3465#false} is VALID [2018-11-14 18:40:11,915 INFO L273 TraceCheckUtils]: 72: Hoare triple {3465#false} assume ~cond == 0; {3465#false} is VALID [2018-11-14 18:40:11,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2018-11-14 18:40:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-14 18:40:11,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:11,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:11,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:11,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:12,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3464#true} is VALID [2018-11-14 18:40:12,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {3464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3464#true} is VALID [2018-11-14 18:40:12,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2018-11-14 18:40:12,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #95#return; {3464#true} is VALID [2018-11-14 18:40:12,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret8 := main(); {3464#true} is VALID [2018-11-14 18:40:12,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {3464#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {3492#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:12,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {3492#(<= main_~a~0 0)} assume true; {3492#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:12,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {3492#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3492#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:12,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {3492#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3492#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:12,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {3492#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:12,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {3467#(<= main_~a~0 1)} assume true; {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:12,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {3467#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:12,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {3467#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3467#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:12,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {3467#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:12,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {3468#(<= main_~a~0 2)} assume true; {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:12,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {3468#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:12,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {3468#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3468#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:12,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {3468#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:12,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {3469#(<= main_~a~0 3)} assume true; {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:12,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {3469#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:12,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {3469#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3469#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:12,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {3469#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:12,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {3470#(<= main_~a~0 4)} assume true; {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:12,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {3470#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:12,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {3470#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3470#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:12,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {3470#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:12,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {3471#(<= main_~a~0 5)} assume true; {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:12,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:12,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {3471#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3471#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:12,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:12,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {3472#(<= main_~a~0 6)} assume true; {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:12,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {3472#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:12,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {3472#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {3472#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:12,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {3472#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {3473#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:12,148 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#(<= main_~a~0 7)} assume true; {3473#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:12,149 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-14 18:40:12,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {3465#false} ~a~0 := 0; {3465#false} is VALID [2018-11-14 18:40:12,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,153 INFO L273 TraceCheckUtils]: 59: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {3465#false} ~a~0 := ~a~0 + 1; {3465#false} is VALID [2018-11-14 18:40:12,154 INFO L273 TraceCheckUtils]: 65: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {3465#false} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-14 18:40:12,155 INFO L273 TraceCheckUtils]: 67: Hoare triple {3465#false} havoc ~x~0;~x~0 := 0; {3465#false} is VALID [2018-11-14 18:40:12,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-14 18:40:12,155 INFO L273 TraceCheckUtils]: 69: Hoare triple {3465#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {3465#false} is VALID [2018-11-14 18:40:12,155 INFO L256 TraceCheckUtils]: 70: Hoare triple {3465#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {3465#false} is VALID [2018-11-14 18:40:12,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {3465#false} ~cond := #in~cond; {3465#false} is VALID [2018-11-14 18:40:12,156 INFO L273 TraceCheckUtils]: 72: Hoare triple {3465#false} assume ~cond == 0; {3465#false} is VALID [2018-11-14 18:40:12,156 INFO L273 TraceCheckUtils]: 73: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2018-11-14 18:40:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-14 18:40:12,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:12,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:40:12,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-14 18:40:12,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:12,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:40:12,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:12,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:40:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:40:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:40:12,239 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 11 states. [2018-11-14 18:40:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:12,546 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-11-14 18:40:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:40:12,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-14 18:40:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:40:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2018-11-14 18:40:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:40:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2018-11-14 18:40:12,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 148 transitions. [2018-11-14 18:40:12,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:12,757 INFO L225 Difference]: With dead ends: 146 [2018-11-14 18:40:12,757 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 18:40:12,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:40:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 18:40:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-14 18:40:12,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:12,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 93 states. [2018-11-14 18:40:12,782 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 93 states. [2018-11-14 18:40:12,782 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 93 states. [2018-11-14 18:40:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:12,786 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-14 18:40:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2018-11-14 18:40:12,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:12,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:12,787 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 97 states. [2018-11-14 18:40:12,787 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 97 states. [2018-11-14 18:40:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:12,791 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-14 18:40:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2018-11-14 18:40:12,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:12,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:12,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:12,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 18:40:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2018-11-14 18:40:12,796 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 74 [2018-11-14 18:40:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:12,796 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2018-11-14 18:40:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:40:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2018-11-14 18:40:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 18:40:12,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:12,797 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:12,798 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1571931603, now seen corresponding path program 8 times [2018-11-14 18:40:12,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:12,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:12,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:13,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {4196#true} call ULTIMATE.init(); {4196#true} is VALID [2018-11-14 18:40:13,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {4196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4196#true} is VALID [2018-11-14 18:40:13,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {4196#true} assume true; {4196#true} is VALID [2018-11-14 18:40:13,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4196#true} {4196#true} #95#return; {4196#true} is VALID [2018-11-14 18:40:13,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {4196#true} call #t~ret8 := main(); {4196#true} is VALID [2018-11-14 18:40:13,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {4196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {4198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:13,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {4198#(= main_~a~0 0)} assume true; {4198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:13,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {4198#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:13,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {4198#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4198#(= main_~a~0 0)} is VALID [2018-11-14 18:40:13,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {4198#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {4199#(<= main_~a~0 1)} assume true; {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {4199#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {4199#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {4200#(<= main_~a~0 2)} assume true; {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {4200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {4200#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {4200#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#(<= main_~a~0 3)} assume true; {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {4201#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~a~0 4)} assume true; {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {4202#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {4202#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {4203#(<= main_~a~0 5)} assume true; {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {4203#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {4203#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {4203#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {4204#(<= main_~a~0 6)} assume true; {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {4204#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {4204#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {4204#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {4205#(<= main_~a~0 7)} assume true; {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {4205#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {4205#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {4205#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {4206#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:13,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {4206#(<= main_~a~0 8)} assume true; {4206#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:13,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {4206#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-14 18:40:13,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {4197#false} ~a~0 := 0; {4197#false} is VALID [2018-11-14 18:40:13,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,236 INFO L273 TraceCheckUtils]: 55: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,237 INFO L273 TraceCheckUtils]: 57: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,237 INFO L273 TraceCheckUtils]: 58: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,237 INFO L273 TraceCheckUtils]: 59: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,237 INFO L273 TraceCheckUtils]: 60: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,237 INFO L273 TraceCheckUtils]: 61: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,237 INFO L273 TraceCheckUtils]: 62: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,238 INFO L273 TraceCheckUtils]: 63: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,238 INFO L273 TraceCheckUtils]: 64: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,238 INFO L273 TraceCheckUtils]: 65: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,238 INFO L273 TraceCheckUtils]: 67: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,239 INFO L273 TraceCheckUtils]: 71: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,239 INFO L273 TraceCheckUtils]: 72: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,239 INFO L273 TraceCheckUtils]: 73: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,240 INFO L273 TraceCheckUtils]: 74: Hoare triple {4197#false} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-14 18:40:13,240 INFO L273 TraceCheckUtils]: 75: Hoare triple {4197#false} havoc ~x~0;~x~0 := 0; {4197#false} is VALID [2018-11-14 18:40:13,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {4197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,240 INFO L256 TraceCheckUtils]: 78: Hoare triple {4197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4197#false} is VALID [2018-11-14 18:40:13,241 INFO L273 TraceCheckUtils]: 79: Hoare triple {4197#false} ~cond := #in~cond; {4197#false} is VALID [2018-11-14 18:40:13,241 INFO L273 TraceCheckUtils]: 80: Hoare triple {4197#false} assume ~cond == 0; {4197#false} is VALID [2018-11-14 18:40:13,241 INFO L273 TraceCheckUtils]: 81: Hoare triple {4197#false} assume !false; {4197#false} is VALID [2018-11-14 18:40:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-14 18:40:13,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:13,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:13,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:40:13,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:40:13,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:13,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:13,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {4196#true} call ULTIMATE.init(); {4196#true} is VALID [2018-11-14 18:40:13,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {4196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4196#true} is VALID [2018-11-14 18:40:13,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {4196#true} assume true; {4196#true} is VALID [2018-11-14 18:40:13,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4196#true} {4196#true} #95#return; {4196#true} is VALID [2018-11-14 18:40:13,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {4196#true} call #t~ret8 := main(); {4196#true} is VALID [2018-11-14 18:40:13,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {4196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {4225#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:13,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {4225#(<= main_~a~0 0)} assume true; {4225#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:13,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {4225#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4225#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:13,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {4225#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4225#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:13,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {4225#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {4199#(<= main_~a~0 1)} assume true; {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {4199#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4199#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:13,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {4199#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {4200#(<= main_~a~0 2)} assume true; {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {4200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {4200#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4200#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:13,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {4200#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#(<= main_~a~0 3)} assume true; {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {4201#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4201#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:13,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~a~0 4)} assume true; {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {4202#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4202#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:13,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {4202#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {4203#(<= main_~a~0 5)} assume true; {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {4203#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {4203#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4203#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:13,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {4203#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {4204#(<= main_~a~0 6)} assume true; {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,534 INFO L273 TraceCheckUtils]: 31: Hoare triple {4204#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {4204#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4204#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:13,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {4204#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,536 INFO L273 TraceCheckUtils]: 34: Hoare triple {4205#(<= main_~a~0 7)} assume true; {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {4205#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,537 INFO L273 TraceCheckUtils]: 36: Hoare triple {4205#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4205#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:13,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {4205#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {4206#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:13,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {4206#(<= main_~a~0 8)} assume true; {4206#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:13,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {4206#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-14 18:40:13,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {4197#false} ~a~0 := 0; {4197#false} is VALID [2018-11-14 18:40:13,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,540 INFO L273 TraceCheckUtils]: 45: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,540 INFO L273 TraceCheckUtils]: 46: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,540 INFO L273 TraceCheckUtils]: 47: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,540 INFO L273 TraceCheckUtils]: 48: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,541 INFO L273 TraceCheckUtils]: 49: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,541 INFO L273 TraceCheckUtils]: 50: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,541 INFO L273 TraceCheckUtils]: 52: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 53: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 54: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 55: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 56: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 58: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,542 INFO L273 TraceCheckUtils]: 59: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,543 INFO L273 TraceCheckUtils]: 61: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,543 INFO L273 TraceCheckUtils]: 62: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,543 INFO L273 TraceCheckUtils]: 63: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,543 INFO L273 TraceCheckUtils]: 64: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 68: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 70: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,544 INFO L273 TraceCheckUtils]: 71: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,545 INFO L273 TraceCheckUtils]: 72: Hoare triple {4197#false} ~a~0 := ~a~0 + 1; {4197#false} is VALID [2018-11-14 18:40:13,545 INFO L273 TraceCheckUtils]: 73: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,545 INFO L273 TraceCheckUtils]: 74: Hoare triple {4197#false} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-14 18:40:13,545 INFO L273 TraceCheckUtils]: 75: Hoare triple {4197#false} havoc ~x~0;~x~0 := 0; {4197#false} is VALID [2018-11-14 18:40:13,545 INFO L273 TraceCheckUtils]: 76: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-14 18:40:13,545 INFO L273 TraceCheckUtils]: 77: Hoare triple {4197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {4197#false} is VALID [2018-11-14 18:40:13,546 INFO L256 TraceCheckUtils]: 78: Hoare triple {4197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4197#false} is VALID [2018-11-14 18:40:13,546 INFO L273 TraceCheckUtils]: 79: Hoare triple {4197#false} ~cond := #in~cond; {4197#false} is VALID [2018-11-14 18:40:13,546 INFO L273 TraceCheckUtils]: 80: Hoare triple {4197#false} assume ~cond == 0; {4197#false} is VALID [2018-11-14 18:40:13,546 INFO L273 TraceCheckUtils]: 81: Hoare triple {4197#false} assume !false; {4197#false} is VALID [2018-11-14 18:40:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-14 18:40:13,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:13,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:40:13,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2018-11-14 18:40:13,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:13,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:40:13,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:13,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:40:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:40:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:40:13,644 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 12 states. [2018-11-14 18:40:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:14,187 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2018-11-14 18:40:14,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:40:14,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2018-11-14 18:40:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:40:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2018-11-14 18:40:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:40:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2018-11-14 18:40:14,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 158 transitions. [2018-11-14 18:40:14,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:14,826 INFO L225 Difference]: With dead ends: 158 [2018-11-14 18:40:14,826 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 18:40:14,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:40:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 18:40:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-11-14 18:40:14,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:14,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 101 states. [2018-11-14 18:40:14,857 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 101 states. [2018-11-14 18:40:14,857 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 101 states. [2018-11-14 18:40:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:14,859 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-14 18:40:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2018-11-14 18:40:14,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:14,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:14,860 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 105 states. [2018-11-14 18:40:14,860 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 105 states. [2018-11-14 18:40:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:14,864 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-14 18:40:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2018-11-14 18:40:14,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:14,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:14,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:14,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:40:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-11-14 18:40:14,868 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 82 [2018-11-14 18:40:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:14,868 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-11-14 18:40:14,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:40:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-11-14 18:40:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 18:40:14,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:14,870 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:14,870 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:14,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 346003667, now seen corresponding path program 9 times [2018-11-14 18:40:14,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:14,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:14,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:14,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:15,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {4994#true} call ULTIMATE.init(); {4994#true} is VALID [2018-11-14 18:40:15,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {4994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4994#true} is VALID [2018-11-14 18:40:15,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {4994#true} assume true; {4994#true} is VALID [2018-11-14 18:40:15,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4994#true} {4994#true} #95#return; {4994#true} is VALID [2018-11-14 18:40:15,374 INFO L256 TraceCheckUtils]: 4: Hoare triple {4994#true} call #t~ret8 := main(); {4994#true} is VALID [2018-11-14 18:40:15,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {4994#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {4996#(= main_~a~0 0)} is VALID [2018-11-14 18:40:15,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {4996#(= main_~a~0 0)} assume true; {4996#(= main_~a~0 0)} is VALID [2018-11-14 18:40:15,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {4996#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4996#(= main_~a~0 0)} is VALID [2018-11-14 18:40:15,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {4996#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4996#(= main_~a~0 0)} is VALID [2018-11-14 18:40:15,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {4996#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {4997#(<= main_~a~0 1)} assume true; {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {4997#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {4997#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~a~0 2)} assume true; {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {4999#(<= main_~a~0 3)} assume true; {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {4999#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {4999#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {4999#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {5000#(<= main_~a~0 4)} assume true; {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {5000#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {5000#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {5000#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~a~0 5)} assume true; {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {5002#(<= main_~a~0 6)} assume true; {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,391 INFO L273 TraceCheckUtils]: 31: Hoare triple {5002#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,392 INFO L273 TraceCheckUtils]: 32: Hoare triple {5002#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {5002#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {5003#(<= main_~a~0 7)} assume true; {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {5003#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {5003#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,395 INFO L273 TraceCheckUtils]: 37: Hoare triple {5003#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,396 INFO L273 TraceCheckUtils]: 38: Hoare triple {5004#(<= main_~a~0 8)} assume true; {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {5004#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,397 INFO L273 TraceCheckUtils]: 40: Hoare triple {5004#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,398 INFO L273 TraceCheckUtils]: 41: Hoare triple {5004#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {5005#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:15,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {5005#(<= main_~a~0 9)} assume true; {5005#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:15,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {5005#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-14 18:40:15,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {4995#false} ~a~0 := 0; {4995#false} is VALID [2018-11-14 18:40:15,400 INFO L273 TraceCheckUtils]: 45: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,400 INFO L273 TraceCheckUtils]: 46: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,401 INFO L273 TraceCheckUtils]: 47: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,401 INFO L273 TraceCheckUtils]: 48: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,401 INFO L273 TraceCheckUtils]: 49: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,402 INFO L273 TraceCheckUtils]: 51: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,402 INFO L273 TraceCheckUtils]: 52: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,402 INFO L273 TraceCheckUtils]: 53: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,402 INFO L273 TraceCheckUtils]: 54: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,402 INFO L273 TraceCheckUtils]: 55: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,403 INFO L273 TraceCheckUtils]: 56: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,403 INFO L273 TraceCheckUtils]: 57: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,403 INFO L273 TraceCheckUtils]: 58: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,403 INFO L273 TraceCheckUtils]: 59: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,403 INFO L273 TraceCheckUtils]: 60: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,403 INFO L273 TraceCheckUtils]: 61: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,404 INFO L273 TraceCheckUtils]: 62: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,404 INFO L273 TraceCheckUtils]: 63: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,404 INFO L273 TraceCheckUtils]: 64: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,404 INFO L273 TraceCheckUtils]: 65: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,404 INFO L273 TraceCheckUtils]: 66: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,404 INFO L273 TraceCheckUtils]: 67: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,405 INFO L273 TraceCheckUtils]: 68: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,405 INFO L273 TraceCheckUtils]: 69: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,405 INFO L273 TraceCheckUtils]: 70: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,405 INFO L273 TraceCheckUtils]: 71: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,405 INFO L273 TraceCheckUtils]: 72: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,406 INFO L273 TraceCheckUtils]: 73: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,406 INFO L273 TraceCheckUtils]: 74: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,406 INFO L273 TraceCheckUtils]: 75: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,406 INFO L273 TraceCheckUtils]: 76: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,406 INFO L273 TraceCheckUtils]: 77: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,407 INFO L273 TraceCheckUtils]: 78: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,407 INFO L273 TraceCheckUtils]: 79: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,407 INFO L273 TraceCheckUtils]: 80: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,407 INFO L273 TraceCheckUtils]: 81: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,407 INFO L273 TraceCheckUtils]: 82: Hoare triple {4995#false} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-14 18:40:15,408 INFO L273 TraceCheckUtils]: 83: Hoare triple {4995#false} havoc ~x~0;~x~0 := 0; {4995#false} is VALID [2018-11-14 18:40:15,408 INFO L273 TraceCheckUtils]: 84: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,408 INFO L273 TraceCheckUtils]: 85: Hoare triple {4995#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,408 INFO L256 TraceCheckUtils]: 86: Hoare triple {4995#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4995#false} is VALID [2018-11-14 18:40:15,408 INFO L273 TraceCheckUtils]: 87: Hoare triple {4995#false} ~cond := #in~cond; {4995#false} is VALID [2018-11-14 18:40:15,409 INFO L273 TraceCheckUtils]: 88: Hoare triple {4995#false} assume ~cond == 0; {4995#false} is VALID [2018-11-14 18:40:15,409 INFO L273 TraceCheckUtils]: 89: Hoare triple {4995#false} assume !false; {4995#false} is VALID [2018-11-14 18:40:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-14 18:40:15,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:15,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:40:15,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:40:15,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:15,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:15,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {4994#true} call ULTIMATE.init(); {4994#true} is VALID [2018-11-14 18:40:15,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {4994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4994#true} is VALID [2018-11-14 18:40:15,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {4994#true} assume true; {4994#true} is VALID [2018-11-14 18:40:15,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4994#true} {4994#true} #95#return; {4994#true} is VALID [2018-11-14 18:40:15,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {4994#true} call #t~ret8 := main(); {4994#true} is VALID [2018-11-14 18:40:15,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {4994#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {5024#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:15,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {5024#(<= main_~a~0 0)} assume true; {5024#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:15,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {5024#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5024#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:15,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {5024#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5024#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:15,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {5024#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {4997#(<= main_~a~0 1)} assume true; {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {4997#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {4997#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4997#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:15,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~a~0 2)} assume true; {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4998#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:15,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {4999#(<= main_~a~0 3)} assume true; {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {4999#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {4999#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {4999#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:15,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {4999#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {5000#(<= main_~a~0 4)} assume true; {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {5000#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {5000#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5000#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:15,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {5000#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~a~0 5)} assume true; {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5001#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:15,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {5002#(<= main_~a~0 6)} assume true; {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {5002#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {5002#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5002#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:15,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {5002#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {5003#(<= main_~a~0 7)} assume true; {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {5003#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {5003#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5003#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:15,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {5003#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {5004#(<= main_~a~0 8)} assume true; {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {5004#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {5004#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5004#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:15,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {5004#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {5005#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:15,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {5005#(<= main_~a~0 9)} assume true; {5005#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:15,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {5005#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-14 18:40:15,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {4995#false} ~a~0 := 0; {4995#false} is VALID [2018-11-14 18:40:15,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,807 INFO L273 TraceCheckUtils]: 50: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,807 INFO L273 TraceCheckUtils]: 51: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,807 INFO L273 TraceCheckUtils]: 52: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 57: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 58: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 60: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,808 INFO L273 TraceCheckUtils]: 61: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 62: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 63: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 64: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 68: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 70: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 71: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 72: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 74: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 75: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 76: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 77: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,810 INFO L273 TraceCheckUtils]: 78: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,811 INFO L273 TraceCheckUtils]: 79: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,811 INFO L273 TraceCheckUtils]: 80: Hoare triple {4995#false} ~a~0 := ~a~0 + 1; {4995#false} is VALID [2018-11-14 18:40:15,811 INFO L273 TraceCheckUtils]: 81: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {4995#false} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-14 18:40:15,811 INFO L273 TraceCheckUtils]: 83: Hoare triple {4995#false} havoc ~x~0;~x~0 := 0; {4995#false} is VALID [2018-11-14 18:40:15,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-14 18:40:15,812 INFO L273 TraceCheckUtils]: 85: Hoare triple {4995#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {4995#false} is VALID [2018-11-14 18:40:15,812 INFO L256 TraceCheckUtils]: 86: Hoare triple {4995#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4995#false} is VALID [2018-11-14 18:40:15,812 INFO L273 TraceCheckUtils]: 87: Hoare triple {4995#false} ~cond := #in~cond; {4995#false} is VALID [2018-11-14 18:40:15,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {4995#false} assume ~cond == 0; {4995#false} is VALID [2018-11-14 18:40:15,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {4995#false} assume !false; {4995#false} is VALID [2018-11-14 18:40:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-14 18:40:15,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:15,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:40:15,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-11-14 18:40:15,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:15,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:40:15,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:15,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:40:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:40:15,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:40:15,909 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 13 states. [2018-11-14 18:40:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:16,752 INFO L93 Difference]: Finished difference Result 170 states and 210 transitions. [2018-11-14 18:40:16,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:40:16,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-11-14 18:40:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:40:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-14 18:40:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:40:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-14 18:40:16,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 168 transitions. [2018-11-14 18:40:16,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:16,910 INFO L225 Difference]: With dead ends: 170 [2018-11-14 18:40:16,910 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 18:40:16,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:40:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 18:40:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-11-14 18:40:16,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:16,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 109 states. [2018-11-14 18:40:16,936 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 109 states. [2018-11-14 18:40:16,937 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 109 states. [2018-11-14 18:40:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:16,940 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2018-11-14 18:40:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-14 18:40:16,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:16,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:16,941 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 113 states. [2018-11-14 18:40:16,941 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 113 states. [2018-11-14 18:40:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:16,943 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2018-11-14 18:40:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-14 18:40:16,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:16,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:16,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:16,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-14 18:40:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2018-11-14 18:40:16,947 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 90 [2018-11-14 18:40:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:16,947 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2018-11-14 18:40:16,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:40:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2018-11-14 18:40:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-14 18:40:16,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:16,948 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:16,949 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:16,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1442881069, now seen corresponding path program 10 times [2018-11-14 18:40:16,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:16,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:16,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:17,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5858#true} is VALID [2018-11-14 18:40:17,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {5858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5858#true} is VALID [2018-11-14 18:40:17,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2018-11-14 18:40:17,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #95#return; {5858#true} is VALID [2018-11-14 18:40:17,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret8 := main(); {5858#true} is VALID [2018-11-14 18:40:17,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {5858#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {5860#(= main_~a~0 0)} is VALID [2018-11-14 18:40:17,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {5860#(= main_~a~0 0)} assume true; {5860#(= main_~a~0 0)} is VALID [2018-11-14 18:40:17,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {5860#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5860#(= main_~a~0 0)} is VALID [2018-11-14 18:40:17,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {5860#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5860#(= main_~a~0 0)} is VALID [2018-11-14 18:40:17,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {5860#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:17,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {5861#(<= main_~a~0 1)} assume true; {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:17,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {5861#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:17,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {5861#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:17,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {5861#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:17,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {5862#(<= main_~a~0 2)} assume true; {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:17,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {5862#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:17,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {5862#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:17,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {5862#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:17,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {5863#(<= main_~a~0 3)} assume true; {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:17,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {5863#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:17,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {5863#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:17,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {5863#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:17,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {5864#(<= main_~a~0 4)} assume true; {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:17,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {5864#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:17,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {5864#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:17,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {5864#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:17,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {5865#(<= main_~a~0 5)} assume true; {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:17,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {5865#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:17,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {5865#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:17,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {5865#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:17,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {5866#(<= main_~a~0 6)} assume true; {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:17,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {5866#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:17,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {5866#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:17,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {5866#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:17,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {5867#(<= main_~a~0 7)} assume true; {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:17,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {5867#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:17,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {5867#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:17,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {5867#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:17,839 INFO L273 TraceCheckUtils]: 38: Hoare triple {5868#(<= main_~a~0 8)} assume true; {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:17,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {5868#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:17,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {5868#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:17,841 INFO L273 TraceCheckUtils]: 41: Hoare triple {5868#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:17,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {5869#(<= main_~a~0 9)} assume true; {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:17,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {5869#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:17,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {5869#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:17,843 INFO L273 TraceCheckUtils]: 45: Hoare triple {5869#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {5870#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:17,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {5870#(<= main_~a~0 10)} assume true; {5870#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:17,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {5870#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-14 18:40:17,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {5859#false} ~a~0 := 0; {5859#false} is VALID [2018-11-14 18:40:17,845 INFO L273 TraceCheckUtils]: 49: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,845 INFO L273 TraceCheckUtils]: 50: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,845 INFO L273 TraceCheckUtils]: 51: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,845 INFO L273 TraceCheckUtils]: 52: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,845 INFO L273 TraceCheckUtils]: 53: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,846 INFO L273 TraceCheckUtils]: 54: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,846 INFO L273 TraceCheckUtils]: 55: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,846 INFO L273 TraceCheckUtils]: 57: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,846 INFO L273 TraceCheckUtils]: 58: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,847 INFO L273 TraceCheckUtils]: 59: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,847 INFO L273 TraceCheckUtils]: 60: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,847 INFO L273 TraceCheckUtils]: 61: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,847 INFO L273 TraceCheckUtils]: 63: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,848 INFO L273 TraceCheckUtils]: 64: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,848 INFO L273 TraceCheckUtils]: 65: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,848 INFO L273 TraceCheckUtils]: 66: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,848 INFO L273 TraceCheckUtils]: 67: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,848 INFO L273 TraceCheckUtils]: 68: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,849 INFO L273 TraceCheckUtils]: 69: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,849 INFO L273 TraceCheckUtils]: 70: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,849 INFO L273 TraceCheckUtils]: 71: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,849 INFO L273 TraceCheckUtils]: 72: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 73: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 74: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 75: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 76: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 80: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 83: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 84: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 85: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 86: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 87: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,851 INFO L273 TraceCheckUtils]: 88: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 89: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 90: Hoare triple {5859#false} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 91: Hoare triple {5859#false} havoc ~x~0;~x~0 := 0; {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 92: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 93: Hoare triple {5859#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L256 TraceCheckUtils]: 94: Hoare triple {5859#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 95: Hoare triple {5859#false} ~cond := #in~cond; {5859#false} is VALID [2018-11-14 18:40:17,852 INFO L273 TraceCheckUtils]: 96: Hoare triple {5859#false} assume ~cond == 0; {5859#false} is VALID [2018-11-14 18:40:17,853 INFO L273 TraceCheckUtils]: 97: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2018-11-14 18:40:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 18:40:17,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:17,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:17,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:40:18,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:40:18,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:18,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:18,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5858#true} is VALID [2018-11-14 18:40:18,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {5858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5858#true} is VALID [2018-11-14 18:40:18,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2018-11-14 18:40:18,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #95#return; {5858#true} is VALID [2018-11-14 18:40:18,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret8 := main(); {5858#true} is VALID [2018-11-14 18:40:18,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {5858#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {5889#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:18,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {5889#(<= main_~a~0 0)} assume true; {5889#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:18,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {5889#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5889#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:18,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {5889#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5889#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:18,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {5889#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {5861#(<= main_~a~0 1)} assume true; {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {5861#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {5861#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5861#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {5861#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {5862#(<= main_~a~0 2)} assume true; {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {5862#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {5862#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5862#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {5862#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {5863#(<= main_~a~0 3)} assume true; {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {5863#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {5863#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5863#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {5863#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {5864#(<= main_~a~0 4)} assume true; {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {5864#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {5864#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5864#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {5864#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {5865#(<= main_~a~0 5)} assume true; {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {5865#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {5865#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5865#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {5865#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:18,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {5866#(<= main_~a~0 6)} assume true; {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:18,807 INFO L273 TraceCheckUtils]: 31: Hoare triple {5866#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:18,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {5866#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5866#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:18,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {5866#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:18,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {5867#(<= main_~a~0 7)} assume true; {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:18,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {5867#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:18,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {5867#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5867#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:18,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {5867#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:18,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {5868#(<= main_~a~0 8)} assume true; {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:18,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {5868#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:18,812 INFO L273 TraceCheckUtils]: 40: Hoare triple {5868#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5868#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:18,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {5868#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:18,814 INFO L273 TraceCheckUtils]: 42: Hoare triple {5869#(<= main_~a~0 9)} assume true; {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:18,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {5869#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:18,815 INFO L273 TraceCheckUtils]: 44: Hoare triple {5869#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {5869#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:18,815 INFO L273 TraceCheckUtils]: 45: Hoare triple {5869#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {5870#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:18,816 INFO L273 TraceCheckUtils]: 46: Hoare triple {5870#(<= main_~a~0 10)} assume true; {5870#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:18,817 INFO L273 TraceCheckUtils]: 47: Hoare triple {5870#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-14 18:40:18,817 INFO L273 TraceCheckUtils]: 48: Hoare triple {5859#false} ~a~0 := 0; {5859#false} is VALID [2018-11-14 18:40:18,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,819 INFO L273 TraceCheckUtils]: 57: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,819 INFO L273 TraceCheckUtils]: 58: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,819 INFO L273 TraceCheckUtils]: 59: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,819 INFO L273 TraceCheckUtils]: 60: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 62: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 63: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 64: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 65: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 66: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 67: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,820 INFO L273 TraceCheckUtils]: 68: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 69: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 70: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 71: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 72: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 73: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 74: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 75: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,821 INFO L273 TraceCheckUtils]: 76: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 77: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 78: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 79: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 80: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 81: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 82: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 83: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 84: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,822 INFO L273 TraceCheckUtils]: 85: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 86: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 87: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 88: Hoare triple {5859#false} ~a~0 := ~a~0 + 1; {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 89: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 90: Hoare triple {5859#false} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 91: Hoare triple {5859#false} havoc ~x~0;~x~0 := 0; {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 92: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-14 18:40:18,823 INFO L273 TraceCheckUtils]: 93: Hoare triple {5859#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {5859#false} is VALID [2018-11-14 18:40:18,824 INFO L256 TraceCheckUtils]: 94: Hoare triple {5859#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {5859#false} is VALID [2018-11-14 18:40:18,824 INFO L273 TraceCheckUtils]: 95: Hoare triple {5859#false} ~cond := #in~cond; {5859#false} is VALID [2018-11-14 18:40:18,824 INFO L273 TraceCheckUtils]: 96: Hoare triple {5859#false} assume ~cond == 0; {5859#false} is VALID [2018-11-14 18:40:18,824 INFO L273 TraceCheckUtils]: 97: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2018-11-14 18:40:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 18:40:18,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:40:18,851 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-11-14 18:40:18,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:18,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:40:18,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:18,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:40:18,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:40:18,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:40:18,915 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 14 states. [2018-11-14 18:40:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:19,473 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2018-11-14 18:40:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:40:19,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-11-14 18:40:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:40:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2018-11-14 18:40:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:40:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2018-11-14 18:40:19,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 178 transitions. [2018-11-14 18:40:20,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:20,005 INFO L225 Difference]: With dead ends: 182 [2018-11-14 18:40:20,005 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 18:40:20,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:40:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 18:40:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-11-14 18:40:20,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:20,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 117 states. [2018-11-14 18:40:20,046 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 117 states. [2018-11-14 18:40:20,046 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 117 states. [2018-11-14 18:40:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:20,050 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2018-11-14 18:40:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2018-11-14 18:40:20,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:20,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:20,051 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 121 states. [2018-11-14 18:40:20,051 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 121 states. [2018-11-14 18:40:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:20,054 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2018-11-14 18:40:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2018-11-14 18:40:20,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:20,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:20,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:20,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-14 18:40:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-11-14 18:40:20,058 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 98 [2018-11-14 18:40:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:20,058 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-11-14 18:40:20,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:40:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-11-14 18:40:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-14 18:40:20,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:20,060 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:20,060 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:20,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1343234259, now seen corresponding path program 11 times [2018-11-14 18:40:20,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:20,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:20,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:20,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:20,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:20,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {6788#true} call ULTIMATE.init(); {6788#true} is VALID [2018-11-14 18:40:20,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {6788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6788#true} is VALID [2018-11-14 18:40:20,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:20,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6788#true} {6788#true} #95#return; {6788#true} is VALID [2018-11-14 18:40:20,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {6788#true} call #t~ret8 := main(); {6788#true} is VALID [2018-11-14 18:40:20,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {6788#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {6790#(= main_~a~0 0)} is VALID [2018-11-14 18:40:20,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {6790#(= main_~a~0 0)} assume true; {6790#(= main_~a~0 0)} is VALID [2018-11-14 18:40:20,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {6790#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6790#(= main_~a~0 0)} is VALID [2018-11-14 18:40:20,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {6790#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6790#(= main_~a~0 0)} is VALID [2018-11-14 18:40:20,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {6790#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:20,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {6791#(<= main_~a~0 1)} assume true; {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:20,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {6791#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:20,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {6791#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:20,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {6791#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:20,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {6792#(<= main_~a~0 2)} assume true; {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:20,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {6792#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:20,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:20,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:20,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~a~0 3)} assume true; {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:20,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:20,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {6793#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:20,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:20,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~a~0 4)} assume true; {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:20,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {6794#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:20,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {6794#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:20,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {6794#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:20,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {6795#(<= main_~a~0 5)} assume true; {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:20,771 INFO L273 TraceCheckUtils]: 27: Hoare triple {6795#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:20,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {6795#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:20,772 INFO L273 TraceCheckUtils]: 29: Hoare triple {6795#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:20,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {6796#(<= main_~a~0 6)} assume true; {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:20,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {6796#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:20,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {6796#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:20,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {6796#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:20,775 INFO L273 TraceCheckUtils]: 34: Hoare triple {6797#(<= main_~a~0 7)} assume true; {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:20,776 INFO L273 TraceCheckUtils]: 35: Hoare triple {6797#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:20,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {6797#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:20,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {6797#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:20,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {6798#(<= main_~a~0 8)} assume true; {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:20,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {6798#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:20,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {6798#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:20,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {6798#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:20,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {6799#(<= main_~a~0 9)} assume true; {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:20,781 INFO L273 TraceCheckUtils]: 43: Hoare triple {6799#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:20,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {6799#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:20,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {6799#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:20,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {6800#(<= main_~a~0 10)} assume true; {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:20,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {6800#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:20,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {6800#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:20,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {6800#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {6801#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:20,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {6801#(<= main_~a~0 11)} assume true; {6801#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:20,785 INFO L273 TraceCheckUtils]: 51: Hoare triple {6801#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6789#false} is VALID [2018-11-14 18:40:20,786 INFO L273 TraceCheckUtils]: 52: Hoare triple {6789#false} ~a~0 := 0; {6789#false} is VALID [2018-11-14 18:40:20,786 INFO L273 TraceCheckUtils]: 53: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,786 INFO L273 TraceCheckUtils]: 55: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,786 INFO L273 TraceCheckUtils]: 56: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,787 INFO L273 TraceCheckUtils]: 57: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,787 INFO L273 TraceCheckUtils]: 58: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,787 INFO L273 TraceCheckUtils]: 59: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,787 INFO L273 TraceCheckUtils]: 60: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,787 INFO L273 TraceCheckUtils]: 61: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,788 INFO L273 TraceCheckUtils]: 62: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,788 INFO L273 TraceCheckUtils]: 63: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,788 INFO L273 TraceCheckUtils]: 64: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,788 INFO L273 TraceCheckUtils]: 65: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,788 INFO L273 TraceCheckUtils]: 66: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 67: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 68: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 69: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 70: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 71: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 72: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 73: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,789 INFO L273 TraceCheckUtils]: 74: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,790 INFO L273 TraceCheckUtils]: 75: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,790 INFO L273 TraceCheckUtils]: 76: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,790 INFO L273 TraceCheckUtils]: 77: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,790 INFO L273 TraceCheckUtils]: 78: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,790 INFO L273 TraceCheckUtils]: 79: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,790 INFO L273 TraceCheckUtils]: 80: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,791 INFO L273 TraceCheckUtils]: 82: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,791 INFO L273 TraceCheckUtils]: 83: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,791 INFO L273 TraceCheckUtils]: 84: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,791 INFO L273 TraceCheckUtils]: 85: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,791 INFO L273 TraceCheckUtils]: 86: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,792 INFO L273 TraceCheckUtils]: 87: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,792 INFO L273 TraceCheckUtils]: 88: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,792 INFO L273 TraceCheckUtils]: 89: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,792 INFO L273 TraceCheckUtils]: 90: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,792 INFO L273 TraceCheckUtils]: 91: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,792 INFO L273 TraceCheckUtils]: 92: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,793 INFO L273 TraceCheckUtils]: 93: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,793 INFO L273 TraceCheckUtils]: 94: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,793 INFO L273 TraceCheckUtils]: 95: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,793 INFO L273 TraceCheckUtils]: 96: Hoare triple {6789#false} ~a~0 := ~a~0 + 1; {6789#false} is VALID [2018-11-14 18:40:20,793 INFO L273 TraceCheckUtils]: 97: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,793 INFO L273 TraceCheckUtils]: 98: Hoare triple {6789#false} assume !(~a~0 < 100000); {6789#false} is VALID [2018-11-14 18:40:20,794 INFO L273 TraceCheckUtils]: 99: Hoare triple {6789#false} havoc ~x~0;~x~0 := 0; {6789#false} is VALID [2018-11-14 18:40:20,794 INFO L273 TraceCheckUtils]: 100: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:20,794 INFO L273 TraceCheckUtils]: 101: Hoare triple {6789#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:20,794 INFO L256 TraceCheckUtils]: 102: Hoare triple {6789#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {6789#false} is VALID [2018-11-14 18:40:20,794 INFO L273 TraceCheckUtils]: 103: Hoare triple {6789#false} ~cond := #in~cond; {6789#false} is VALID [2018-11-14 18:40:20,794 INFO L273 TraceCheckUtils]: 104: Hoare triple {6789#false} assume ~cond == 0; {6789#false} is VALID [2018-11-14 18:40:20,795 INFO L273 TraceCheckUtils]: 105: Hoare triple {6789#false} assume !false; {6789#false} is VALID [2018-11-14 18:40:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-14 18:40:20,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:20,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:40:23,261 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:40:23,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:23,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:23,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {6788#true} call ULTIMATE.init(); {6788#true} is VALID [2018-11-14 18:40:23,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {6788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6788#true} is VALID [2018-11-14 18:40:23,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6788#true} {6788#true} #95#return; {6788#true} is VALID [2018-11-14 18:40:23,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {6788#true} call #t~ret8 := main(); {6788#true} is VALID [2018-11-14 18:40:23,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {6788#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {6788#true} is VALID [2018-11-14 18:40:23,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 29: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 31: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 32: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,444 INFO L273 TraceCheckUtils]: 34: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 35: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 36: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 37: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 38: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 39: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 40: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 41: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,445 INFO L273 TraceCheckUtils]: 42: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 44: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 45: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 46: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 47: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 48: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {6788#true} ~a~0 := ~a~0 + 1; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-14 18:40:23,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {6788#true} assume !(~a~0 < 100000); {6788#true} is VALID [2018-11-14 18:40:23,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {6788#true} ~a~0 := 0; {6961#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:23,447 INFO L273 TraceCheckUtils]: 53: Hoare triple {6961#(<= main_~a~0 0)} assume true; {6961#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:23,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {6961#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6961#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:23,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {6961#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6961#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:23,448 INFO L273 TraceCheckUtils]: 56: Hoare triple {6961#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:23,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {6791#(<= main_~a~0 1)} assume true; {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:23,449 INFO L273 TraceCheckUtils]: 58: Hoare triple {6791#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:23,449 INFO L273 TraceCheckUtils]: 59: Hoare triple {6791#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6791#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:23,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {6791#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:23,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {6792#(<= main_~a~0 2)} assume true; {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:23,451 INFO L273 TraceCheckUtils]: 62: Hoare triple {6792#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:23,452 INFO L273 TraceCheckUtils]: 63: Hoare triple {6792#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6792#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:23,452 INFO L273 TraceCheckUtils]: 64: Hoare triple {6792#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:23,453 INFO L273 TraceCheckUtils]: 65: Hoare triple {6793#(<= main_~a~0 3)} assume true; {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:23,453 INFO L273 TraceCheckUtils]: 66: Hoare triple {6793#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:23,454 INFO L273 TraceCheckUtils]: 67: Hoare triple {6793#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6793#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:23,455 INFO L273 TraceCheckUtils]: 68: Hoare triple {6793#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:23,455 INFO L273 TraceCheckUtils]: 69: Hoare triple {6794#(<= main_~a~0 4)} assume true; {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:23,456 INFO L273 TraceCheckUtils]: 70: Hoare triple {6794#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:23,456 INFO L273 TraceCheckUtils]: 71: Hoare triple {6794#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6794#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:23,457 INFO L273 TraceCheckUtils]: 72: Hoare triple {6794#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:23,458 INFO L273 TraceCheckUtils]: 73: Hoare triple {6795#(<= main_~a~0 5)} assume true; {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:23,458 INFO L273 TraceCheckUtils]: 74: Hoare triple {6795#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:23,459 INFO L273 TraceCheckUtils]: 75: Hoare triple {6795#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6795#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:23,459 INFO L273 TraceCheckUtils]: 76: Hoare triple {6795#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:23,460 INFO L273 TraceCheckUtils]: 77: Hoare triple {6796#(<= main_~a~0 6)} assume true; {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:23,460 INFO L273 TraceCheckUtils]: 78: Hoare triple {6796#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:23,461 INFO L273 TraceCheckUtils]: 79: Hoare triple {6796#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6796#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:23,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {6796#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:23,462 INFO L273 TraceCheckUtils]: 81: Hoare triple {6797#(<= main_~a~0 7)} assume true; {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:23,463 INFO L273 TraceCheckUtils]: 82: Hoare triple {6797#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:23,463 INFO L273 TraceCheckUtils]: 83: Hoare triple {6797#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6797#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:23,464 INFO L273 TraceCheckUtils]: 84: Hoare triple {6797#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:23,464 INFO L273 TraceCheckUtils]: 85: Hoare triple {6798#(<= main_~a~0 8)} assume true; {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:23,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {6798#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:23,466 INFO L273 TraceCheckUtils]: 87: Hoare triple {6798#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6798#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:23,466 INFO L273 TraceCheckUtils]: 88: Hoare triple {6798#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:23,467 INFO L273 TraceCheckUtils]: 89: Hoare triple {6799#(<= main_~a~0 9)} assume true; {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:23,467 INFO L273 TraceCheckUtils]: 90: Hoare triple {6799#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:23,468 INFO L273 TraceCheckUtils]: 91: Hoare triple {6799#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6799#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:23,469 INFO L273 TraceCheckUtils]: 92: Hoare triple {6799#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:23,469 INFO L273 TraceCheckUtils]: 93: Hoare triple {6800#(<= main_~a~0 10)} assume true; {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:23,470 INFO L273 TraceCheckUtils]: 94: Hoare triple {6800#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:23,470 INFO L273 TraceCheckUtils]: 95: Hoare triple {6800#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {6800#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:23,471 INFO L273 TraceCheckUtils]: 96: Hoare triple {6800#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {6801#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:23,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {6801#(<= main_~a~0 11)} assume true; {6801#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:23,472 INFO L273 TraceCheckUtils]: 98: Hoare triple {6801#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6789#false} is VALID [2018-11-14 18:40:23,472 INFO L273 TraceCheckUtils]: 99: Hoare triple {6789#false} havoc ~x~0;~x~0 := 0; {6789#false} is VALID [2018-11-14 18:40:23,473 INFO L273 TraceCheckUtils]: 100: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-14 18:40:23,473 INFO L273 TraceCheckUtils]: 101: Hoare triple {6789#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {6789#false} is VALID [2018-11-14 18:40:23,473 INFO L256 TraceCheckUtils]: 102: Hoare triple {6789#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {6789#false} is VALID [2018-11-14 18:40:23,473 INFO L273 TraceCheckUtils]: 103: Hoare triple {6789#false} ~cond := #in~cond; {6789#false} is VALID [2018-11-14 18:40:23,473 INFO L273 TraceCheckUtils]: 104: Hoare triple {6789#false} assume ~cond == 0; {6789#false} is VALID [2018-11-14 18:40:23,474 INFO L273 TraceCheckUtils]: 105: Hoare triple {6789#false} assume !false; {6789#false} is VALID [2018-11-14 18:40:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-14 18:40:23,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:23,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:40:23,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2018-11-14 18:40:23,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:23,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:40:23,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:23,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:40:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:40:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:40:23,613 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 15 states. [2018-11-14 18:40:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:24,283 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-11-14 18:40:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:40:24,283 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2018-11-14 18:40:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:40:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2018-11-14 18:40:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:40:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2018-11-14 18:40:24,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 188 transitions. [2018-11-14 18:40:24,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:24,948 INFO L225 Difference]: With dead ends: 194 [2018-11-14 18:40:24,948 INFO L226 Difference]: Without dead ends: 129 [2018-11-14 18:40:24,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:40:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-14 18:40:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-11-14 18:40:24,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:24,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 125 states. [2018-11-14 18:40:24,985 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 125 states. [2018-11-14 18:40:24,985 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 125 states. [2018-11-14 18:40:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:24,988 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-14 18:40:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-14 18:40:24,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:24,989 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 129 states. [2018-11-14 18:40:24,989 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 129 states. [2018-11-14 18:40:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:24,992 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-14 18:40:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-14 18:40:24,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:24,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:24,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:24,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 18:40:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2018-11-14 18:40:24,997 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 106 [2018-11-14 18:40:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:24,997 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2018-11-14 18:40:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:40:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2018-11-14 18:40:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-14 18:40:24,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:24,998 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:24,999 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:24,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash 932238803, now seen corresponding path program 12 times [2018-11-14 18:40:24,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:24,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:25,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:25,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:25,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:26,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {7784#true} call ULTIMATE.init(); {7784#true} is VALID [2018-11-14 18:40:26,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {7784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7784#true} is VALID [2018-11-14 18:40:26,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-14 18:40:26,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7784#true} {7784#true} #95#return; {7784#true} is VALID [2018-11-14 18:40:26,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {7784#true} call #t~ret8 := main(); {7784#true} is VALID [2018-11-14 18:40:26,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {7784#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {7786#(= main_~a~0 0)} is VALID [2018-11-14 18:40:26,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {7786#(= main_~a~0 0)} assume true; {7786#(= main_~a~0 0)} is VALID [2018-11-14 18:40:26,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {7786#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7786#(= main_~a~0 0)} is VALID [2018-11-14 18:40:26,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {7786#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7786#(= main_~a~0 0)} is VALID [2018-11-14 18:40:26,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {7786#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:26,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {7787#(<= main_~a~0 1)} assume true; {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:26,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {7787#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:26,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {7787#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:26,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {7787#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:26,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {7788#(<= main_~a~0 2)} assume true; {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:26,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {7788#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:26,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {7788#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:26,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {7788#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:26,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {7789#(<= main_~a~0 3)} assume true; {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:26,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {7789#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:26,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {7789#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:26,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {7789#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:26,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {7790#(<= main_~a~0 4)} assume true; {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:26,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {7790#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:26,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {7790#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:26,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {7790#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:26,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {7791#(<= main_~a~0 5)} assume true; {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:26,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {7791#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:26,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {7791#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:26,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {7791#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:26,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {7792#(<= main_~a~0 6)} assume true; {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:26,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {7792#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:26,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {7792#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:26,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {7792#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:26,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {7793#(<= main_~a~0 7)} assume true; {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:26,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {7793#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:26,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {7793#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:26,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {7793#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:26,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {7794#(<= main_~a~0 8)} assume true; {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:26,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {7794#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:26,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {7794#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:26,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {7794#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:26,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {7795#(<= main_~a~0 9)} assume true; {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:26,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {7795#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:26,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {7795#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:26,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {7795#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:26,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {7796#(<= main_~a~0 10)} assume true; {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:26,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {7796#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:26,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {7796#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:26,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {7796#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:26,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {7797#(<= main_~a~0 11)} assume true; {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:26,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {7797#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:26,110 INFO L273 TraceCheckUtils]: 52: Hoare triple {7797#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:26,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {7797#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {7798#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:26,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {7798#(<= main_~a~0 12)} assume true; {7798#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:26,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {7798#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-14 18:40:26,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {7785#false} ~a~0 := 0; {7785#false} is VALID [2018-11-14 18:40:26,112 INFO L273 TraceCheckUtils]: 57: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,112 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,113 INFO L273 TraceCheckUtils]: 61: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,113 INFO L273 TraceCheckUtils]: 62: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,113 INFO L273 TraceCheckUtils]: 63: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,113 INFO L273 TraceCheckUtils]: 64: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,114 INFO L273 TraceCheckUtils]: 65: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,114 INFO L273 TraceCheckUtils]: 66: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,114 INFO L273 TraceCheckUtils]: 67: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,114 INFO L273 TraceCheckUtils]: 69: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 70: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 71: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 72: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 73: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 74: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 75: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 76: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,115 INFO L273 TraceCheckUtils]: 77: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 78: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 79: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 80: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 81: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 82: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 83: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 84: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,116 INFO L273 TraceCheckUtils]: 85: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 86: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 87: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 88: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 89: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 90: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 91: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 92: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 93: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,117 INFO L273 TraceCheckUtils]: 94: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 95: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 96: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 97: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 98: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 99: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 100: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 101: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 102: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,118 INFO L273 TraceCheckUtils]: 103: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L273 TraceCheckUtils]: 104: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L273 TraceCheckUtils]: 105: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L273 TraceCheckUtils]: 106: Hoare triple {7785#false} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L273 TraceCheckUtils]: 107: Hoare triple {7785#false} havoc ~x~0;~x~0 := 0; {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L273 TraceCheckUtils]: 108: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L273 TraceCheckUtils]: 109: Hoare triple {7785#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:26,119 INFO L256 TraceCheckUtils]: 110: Hoare triple {7785#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {7785#false} is VALID [2018-11-14 18:40:26,120 INFO L273 TraceCheckUtils]: 111: Hoare triple {7785#false} ~cond := #in~cond; {7785#false} is VALID [2018-11-14 18:40:26,120 INFO L273 TraceCheckUtils]: 112: Hoare triple {7785#false} assume ~cond == 0; {7785#false} is VALID [2018-11-14 18:40:26,120 INFO L273 TraceCheckUtils]: 113: Hoare triple {7785#false} assume !false; {7785#false} is VALID [2018-11-14 18:40:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 18:40:26,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:26,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:26,149 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:40:27,927 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:40:27,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:27,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:28,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {7784#true} call ULTIMATE.init(); {7784#true} is VALID [2018-11-14 18:40:28,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {7784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7784#true} is VALID [2018-11-14 18:40:28,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-14 18:40:28,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7784#true} {7784#true} #95#return; {7784#true} is VALID [2018-11-14 18:40:28,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {7784#true} call #t~ret8 := main(); {7784#true} is VALID [2018-11-14 18:40:28,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {7784#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {7817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {7817#(<= main_~a~0 0)} assume true; {7817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {7817#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {7817#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7817#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {7817#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {7787#(<= main_~a~0 1)} assume true; {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {7787#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {7787#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7787#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {7787#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {7788#(<= main_~a~0 2)} assume true; {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {7788#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {7788#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7788#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {7788#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {7789#(<= main_~a~0 3)} assume true; {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {7789#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {7789#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7789#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {7789#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {7790#(<= main_~a~0 4)} assume true; {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {7790#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {7790#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7790#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {7790#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {7791#(<= main_~a~0 5)} assume true; {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {7791#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {7791#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7791#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {7791#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {7792#(<= main_~a~0 6)} assume true; {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {7792#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {7792#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7792#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {7792#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {7793#(<= main_~a~0 7)} assume true; {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {7793#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {7793#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7793#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {7793#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:28,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {7794#(<= main_~a~0 8)} assume true; {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:28,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {7794#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:28,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {7794#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7794#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:28,203 INFO L273 TraceCheckUtils]: 41: Hoare triple {7794#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:28,204 INFO L273 TraceCheckUtils]: 42: Hoare triple {7795#(<= main_~a~0 9)} assume true; {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:28,204 INFO L273 TraceCheckUtils]: 43: Hoare triple {7795#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:28,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {7795#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7795#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:28,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {7795#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:28,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {7796#(<= main_~a~0 10)} assume true; {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:28,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {7796#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:28,208 INFO L273 TraceCheckUtils]: 48: Hoare triple {7796#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7796#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:28,209 INFO L273 TraceCheckUtils]: 49: Hoare triple {7796#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:28,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {7797#(<= main_~a~0 11)} assume true; {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:28,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {7797#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:28,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {7797#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {7797#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:28,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {7797#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {7798#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:28,212 INFO L273 TraceCheckUtils]: 54: Hoare triple {7798#(<= main_~a~0 12)} assume true; {7798#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:28,213 INFO L273 TraceCheckUtils]: 55: Hoare triple {7798#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-14 18:40:28,213 INFO L273 TraceCheckUtils]: 56: Hoare triple {7785#false} ~a~0 := 0; {7785#false} is VALID [2018-11-14 18:40:28,213 INFO L273 TraceCheckUtils]: 57: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 72: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 73: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 74: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 75: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,217 INFO L273 TraceCheckUtils]: 76: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 77: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 78: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 79: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 80: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 81: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 82: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,218 INFO L273 TraceCheckUtils]: 83: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 85: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 86: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 87: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 88: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 89: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,219 INFO L273 TraceCheckUtils]: 90: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 91: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 94: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 95: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,220 INFO L273 TraceCheckUtils]: 97: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,221 INFO L273 TraceCheckUtils]: 98: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,221 INFO L273 TraceCheckUtils]: 101: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,221 INFO L273 TraceCheckUtils]: 102: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,221 INFO L273 TraceCheckUtils]: 103: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,222 INFO L273 TraceCheckUtils]: 104: Hoare triple {7785#false} ~a~0 := ~a~0 + 1; {7785#false} is VALID [2018-11-14 18:40:28,222 INFO L273 TraceCheckUtils]: 105: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,222 INFO L273 TraceCheckUtils]: 106: Hoare triple {7785#false} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-14 18:40:28,222 INFO L273 TraceCheckUtils]: 107: Hoare triple {7785#false} havoc ~x~0;~x~0 := 0; {7785#false} is VALID [2018-11-14 18:40:28,222 INFO L273 TraceCheckUtils]: 108: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-14 18:40:28,223 INFO L273 TraceCheckUtils]: 109: Hoare triple {7785#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {7785#false} is VALID [2018-11-14 18:40:28,223 INFO L256 TraceCheckUtils]: 110: Hoare triple {7785#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {7785#false} is VALID [2018-11-14 18:40:28,223 INFO L273 TraceCheckUtils]: 111: Hoare triple {7785#false} ~cond := #in~cond; {7785#false} is VALID [2018-11-14 18:40:28,223 INFO L273 TraceCheckUtils]: 112: Hoare triple {7785#false} assume ~cond == 0; {7785#false} is VALID [2018-11-14 18:40:28,224 INFO L273 TraceCheckUtils]: 113: Hoare triple {7785#false} assume !false; {7785#false} is VALID [2018-11-14 18:40:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 18:40:28,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:28,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 18:40:28,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2018-11-14 18:40:28,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:28,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:40:28,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:28,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:40:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:40:28,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:40:28,347 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 16 states. [2018-11-14 18:40:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:29,425 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2018-11-14 18:40:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:40:29,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2018-11-14 18:40:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:40:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 198 transitions. [2018-11-14 18:40:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:40:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 198 transitions. [2018-11-14 18:40:29,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 198 transitions. [2018-11-14 18:40:29,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:29,977 INFO L225 Difference]: With dead ends: 206 [2018-11-14 18:40:29,977 INFO L226 Difference]: Without dead ends: 137 [2018-11-14 18:40:29,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:40:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-14 18:40:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-11-14 18:40:30,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:30,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 133 states. [2018-11-14 18:40:30,028 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 133 states. [2018-11-14 18:40:30,028 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 133 states. [2018-11-14 18:40:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:30,031 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2018-11-14 18:40:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2018-11-14 18:40:30,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:30,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:30,032 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 137 states. [2018-11-14 18:40:30,032 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 137 states. [2018-11-14 18:40:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:30,035 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2018-11-14 18:40:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2018-11-14 18:40:30,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:30,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:30,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:30,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-14 18:40:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-11-14 18:40:30,039 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 114 [2018-11-14 18:40:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:30,040 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-11-14 18:40:30,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:40:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2018-11-14 18:40:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-14 18:40:30,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:30,041 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:30,042 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:30,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1338015955, now seen corresponding path program 13 times [2018-11-14 18:40:30,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:30,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:30,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:30,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {8846#true} call ULTIMATE.init(); {8846#true} is VALID [2018-11-14 18:40:30,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {8846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8846#true} is VALID [2018-11-14 18:40:30,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {8846#true} assume true; {8846#true} is VALID [2018-11-14 18:40:30,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8846#true} {8846#true} #95#return; {8846#true} is VALID [2018-11-14 18:40:30,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {8846#true} call #t~ret8 := main(); {8846#true} is VALID [2018-11-14 18:40:30,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {8846#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {8848#(= main_~a~0 0)} is VALID [2018-11-14 18:40:30,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {8848#(= main_~a~0 0)} assume true; {8848#(= main_~a~0 0)} is VALID [2018-11-14 18:40:30,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {8848#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8848#(= main_~a~0 0)} is VALID [2018-11-14 18:40:30,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {8848#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8848#(= main_~a~0 0)} is VALID [2018-11-14 18:40:30,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {8848#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:30,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {8849#(<= main_~a~0 1)} assume true; {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:30,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {8849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:30,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {8849#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:30,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {8849#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:30,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {8850#(<= main_~a~0 2)} assume true; {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:30,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {8850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:30,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {8850#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:30,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {8850#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:30,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {8851#(<= main_~a~0 3)} assume true; {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:30,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {8851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:30,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {8851#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:30,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:30,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {8852#(<= main_~a~0 4)} assume true; {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:30,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {8852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:30,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {8852#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:30,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {8852#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:30,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {8853#(<= main_~a~0 5)} assume true; {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:30,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {8853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:30,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {8853#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:30,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {8853#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:30,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {8854#(<= main_~a~0 6)} assume true; {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:30,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {8854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:30,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {8854#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:30,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {8854#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:30,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {8855#(<= main_~a~0 7)} assume true; {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:30,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {8855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:30,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {8855#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:30,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {8855#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:30,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {8856#(<= main_~a~0 8)} assume true; {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:30,795 INFO L273 TraceCheckUtils]: 39: Hoare triple {8856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:30,795 INFO L273 TraceCheckUtils]: 40: Hoare triple {8856#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:30,796 INFO L273 TraceCheckUtils]: 41: Hoare triple {8856#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:30,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {8857#(<= main_~a~0 9)} assume true; {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:30,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {8857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:30,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {8857#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:30,798 INFO L273 TraceCheckUtils]: 45: Hoare triple {8857#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:30,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {8858#(<= main_~a~0 10)} assume true; {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:30,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {8858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:30,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {8858#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:30,801 INFO L273 TraceCheckUtils]: 49: Hoare triple {8858#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:30,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {8859#(<= main_~a~0 11)} assume true; {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:30,802 INFO L273 TraceCheckUtils]: 51: Hoare triple {8859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:30,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {8859#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:30,803 INFO L273 TraceCheckUtils]: 53: Hoare triple {8859#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:30,804 INFO L273 TraceCheckUtils]: 54: Hoare triple {8860#(<= main_~a~0 12)} assume true; {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:30,804 INFO L273 TraceCheckUtils]: 55: Hoare triple {8860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:30,805 INFO L273 TraceCheckUtils]: 56: Hoare triple {8860#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:30,805 INFO L273 TraceCheckUtils]: 57: Hoare triple {8860#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {8861#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:30,806 INFO L273 TraceCheckUtils]: 58: Hoare triple {8861#(<= main_~a~0 13)} assume true; {8861#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:30,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {8861#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-14 18:40:30,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {8847#false} ~a~0 := 0; {8847#false} is VALID [2018-11-14 18:40:30,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,807 INFO L273 TraceCheckUtils]: 63: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,808 INFO L273 TraceCheckUtils]: 66: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,808 INFO L273 TraceCheckUtils]: 67: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 70: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 71: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 78: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 82: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 84: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 85: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,810 INFO L273 TraceCheckUtils]: 86: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 87: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 88: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 89: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 90: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 91: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 92: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 93: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 94: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,811 INFO L273 TraceCheckUtils]: 95: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 96: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 97: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 98: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 99: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 100: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 101: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 102: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,812 INFO L273 TraceCheckUtils]: 103: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 104: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 105: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 106: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 107: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 108: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 109: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 110: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 111: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,813 INFO L273 TraceCheckUtils]: 112: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 113: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 114: Hoare triple {8847#false} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 115: Hoare triple {8847#false} havoc ~x~0;~x~0 := 0; {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 116: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 117: Hoare triple {8847#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L256 TraceCheckUtils]: 118: Hoare triple {8847#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 119: Hoare triple {8847#false} ~cond := #in~cond; {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 120: Hoare triple {8847#false} assume ~cond == 0; {8847#false} is VALID [2018-11-14 18:40:30,814 INFO L273 TraceCheckUtils]: 121: Hoare triple {8847#false} assume !false; {8847#false} is VALID [2018-11-14 18:40:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-14 18:40:30,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:30,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:30,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:31,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {8846#true} call ULTIMATE.init(); {8846#true} is VALID [2018-11-14 18:40:31,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {8846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8846#true} is VALID [2018-11-14 18:40:31,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {8846#true} assume true; {8846#true} is VALID [2018-11-14 18:40:31,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8846#true} {8846#true} #95#return; {8846#true} is VALID [2018-11-14 18:40:31,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {8846#true} call #t~ret8 := main(); {8846#true} is VALID [2018-11-14 18:40:31,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {8846#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {8880#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:31,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {8880#(<= main_~a~0 0)} assume true; {8880#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:31,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {8880#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8880#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:31,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {8880#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8880#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:31,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {8880#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {8849#(<= main_~a~0 1)} assume true; {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {8849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {8849#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8849#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {8849#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {8850#(<= main_~a~0 2)} assume true; {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {8850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {8850#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8850#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {8850#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {8851#(<= main_~a~0 3)} assume true; {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {8851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {8851#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8851#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {8852#(<= main_~a~0 4)} assume true; {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {8852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {8852#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8852#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {8852#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {8853#(<= main_~a~0 5)} assume true; {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {8853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {8853#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8853#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {8853#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {8854#(<= main_~a~0 6)} assume true; {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {8854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {8854#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8854#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {8854#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {8855#(<= main_~a~0 7)} assume true; {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,269 INFO L273 TraceCheckUtils]: 35: Hoare triple {8855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,269 INFO L273 TraceCheckUtils]: 36: Hoare triple {8855#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8855#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,270 INFO L273 TraceCheckUtils]: 37: Hoare triple {8855#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {8856#(<= main_~a~0 8)} assume true; {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {8856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {8856#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8856#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {8856#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:31,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {8857#(<= main_~a~0 9)} assume true; {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:31,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {8857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:31,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {8857#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8857#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:31,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {8857#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:31,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {8858#(<= main_~a~0 10)} assume true; {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:31,276 INFO L273 TraceCheckUtils]: 47: Hoare triple {8858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:31,276 INFO L273 TraceCheckUtils]: 48: Hoare triple {8858#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8858#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:31,277 INFO L273 TraceCheckUtils]: 49: Hoare triple {8858#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:31,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {8859#(<= main_~a~0 11)} assume true; {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:31,278 INFO L273 TraceCheckUtils]: 51: Hoare triple {8859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:31,279 INFO L273 TraceCheckUtils]: 52: Hoare triple {8859#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8859#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:31,279 INFO L273 TraceCheckUtils]: 53: Hoare triple {8859#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:31,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {8860#(<= main_~a~0 12)} assume true; {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:31,280 INFO L273 TraceCheckUtils]: 55: Hoare triple {8860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:31,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {8860#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {8860#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:31,282 INFO L273 TraceCheckUtils]: 57: Hoare triple {8860#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {8861#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:31,282 INFO L273 TraceCheckUtils]: 58: Hoare triple {8861#(<= main_~a~0 13)} assume true; {8861#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:31,283 INFO L273 TraceCheckUtils]: 59: Hoare triple {8861#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-14 18:40:31,283 INFO L273 TraceCheckUtils]: 60: Hoare triple {8847#false} ~a~0 := 0; {8847#false} is VALID [2018-11-14 18:40:31,283 INFO L273 TraceCheckUtils]: 61: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,284 INFO L273 TraceCheckUtils]: 63: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,284 INFO L273 TraceCheckUtils]: 64: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,284 INFO L273 TraceCheckUtils]: 65: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,284 INFO L273 TraceCheckUtils]: 66: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,285 INFO L273 TraceCheckUtils]: 67: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,285 INFO L273 TraceCheckUtils]: 68: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,285 INFO L273 TraceCheckUtils]: 69: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,285 INFO L273 TraceCheckUtils]: 70: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,285 INFO L273 TraceCheckUtils]: 71: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,285 INFO L273 TraceCheckUtils]: 72: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,286 INFO L273 TraceCheckUtils]: 74: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,286 INFO L273 TraceCheckUtils]: 75: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,286 INFO L273 TraceCheckUtils]: 76: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,286 INFO L273 TraceCheckUtils]: 77: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,287 INFO L273 TraceCheckUtils]: 78: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,287 INFO L273 TraceCheckUtils]: 79: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,287 INFO L273 TraceCheckUtils]: 80: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,287 INFO L273 TraceCheckUtils]: 81: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 83: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 85: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 86: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 87: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 88: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 89: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 90: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,288 INFO L273 TraceCheckUtils]: 91: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 92: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 94: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 96: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 97: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 98: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 99: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,289 INFO L273 TraceCheckUtils]: 100: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 101: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 102: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 103: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 104: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 105: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 106: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 107: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 108: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,290 INFO L273 TraceCheckUtils]: 109: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 110: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 111: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 112: Hoare triple {8847#false} ~a~0 := ~a~0 + 1; {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 113: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 114: Hoare triple {8847#false} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 115: Hoare triple {8847#false} havoc ~x~0;~x~0 := 0; {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 116: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L273 TraceCheckUtils]: 117: Hoare triple {8847#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {8847#false} is VALID [2018-11-14 18:40:31,291 INFO L256 TraceCheckUtils]: 118: Hoare triple {8847#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {8847#false} is VALID [2018-11-14 18:40:31,292 INFO L273 TraceCheckUtils]: 119: Hoare triple {8847#false} ~cond := #in~cond; {8847#false} is VALID [2018-11-14 18:40:31,292 INFO L273 TraceCheckUtils]: 120: Hoare triple {8847#false} assume ~cond == 0; {8847#false} is VALID [2018-11-14 18:40:31,292 INFO L273 TraceCheckUtils]: 121: Hoare triple {8847#false} assume !false; {8847#false} is VALID [2018-11-14 18:40:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-14 18:40:31,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:31,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:40:31,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-14 18:40:31,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:31,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:40:31,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:31,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:40:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:40:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:40:31,396 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 17 states. [2018-11-14 18:40:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:32,065 INFO L93 Difference]: Finished difference Result 218 states and 270 transitions. [2018-11-14 18:40:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:40:32,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-14 18:40:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:40:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 208 transitions. [2018-11-14 18:40:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:40:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 208 transitions. [2018-11-14 18:40:32,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 208 transitions. [2018-11-14 18:40:32,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:32,264 INFO L225 Difference]: With dead ends: 218 [2018-11-14 18:40:32,264 INFO L226 Difference]: Without dead ends: 145 [2018-11-14 18:40:32,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:40:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-14 18:40:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-11-14 18:40:32,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:32,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 141 states. [2018-11-14 18:40:32,373 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 141 states. [2018-11-14 18:40:32,374 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 141 states. [2018-11-14 18:40:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:32,377 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-11-14 18:40:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2018-11-14 18:40:32,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:32,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:32,377 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 145 states. [2018-11-14 18:40:32,378 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 145 states. [2018-11-14 18:40:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:32,380 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-11-14 18:40:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2018-11-14 18:40:32,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:32,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:32,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:32,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-14 18:40:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 173 transitions. [2018-11-14 18:40:32,383 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 173 transitions. Word has length 122 [2018-11-14 18:40:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:32,383 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 173 transitions. [2018-11-14 18:40:32,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:40:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2018-11-14 18:40:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 18:40:32,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:32,385 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:32,385 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:32,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:32,385 INFO L82 PathProgramCache]: Analyzing trace with hash 106832339, now seen corresponding path program 14 times [2018-11-14 18:40:32,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:32,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:32,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:32,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:32,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:32,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2018-11-14 18:40:32,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {9974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9974#true} is VALID [2018-11-14 18:40:32,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2018-11-14 18:40:32,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #95#return; {9974#true} is VALID [2018-11-14 18:40:32,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret8 := main(); {9974#true} is VALID [2018-11-14 18:40:32,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {9974#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {9976#(= main_~a~0 0)} is VALID [2018-11-14 18:40:32,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {9976#(= main_~a~0 0)} assume true; {9976#(= main_~a~0 0)} is VALID [2018-11-14 18:40:32,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {9976#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9976#(= main_~a~0 0)} is VALID [2018-11-14 18:40:32,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {9976#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9976#(= main_~a~0 0)} is VALID [2018-11-14 18:40:32,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {9976#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:32,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {9977#(<= main_~a~0 1)} assume true; {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:32,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {9977#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:32,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {9977#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:32,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {9977#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:32,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {9978#(<= main_~a~0 2)} assume true; {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:32,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {9978#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:32,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {9978#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:32,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {9978#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:32,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {9979#(<= main_~a~0 3)} assume true; {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:32,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {9979#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:32,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {9979#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:32,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {9979#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:32,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {9980#(<= main_~a~0 4)} assume true; {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:32,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {9980#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:32,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {9980#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:32,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {9980#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:32,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {9981#(<= main_~a~0 5)} assume true; {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:32,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {9981#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:32,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {9981#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:32,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {9981#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:32,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {9982#(<= main_~a~0 6)} assume true; {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:32,718 INFO L273 TraceCheckUtils]: 31: Hoare triple {9982#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:32,718 INFO L273 TraceCheckUtils]: 32: Hoare triple {9982#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:32,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {9982#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:32,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {9983#(<= main_~a~0 7)} assume true; {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:32,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {9983#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:32,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {9983#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:32,722 INFO L273 TraceCheckUtils]: 37: Hoare triple {9983#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:32,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {9984#(<= main_~a~0 8)} assume true; {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:32,723 INFO L273 TraceCheckUtils]: 39: Hoare triple {9984#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:32,723 INFO L273 TraceCheckUtils]: 40: Hoare triple {9984#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:32,724 INFO L273 TraceCheckUtils]: 41: Hoare triple {9984#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:32,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {9985#(<= main_~a~0 9)} assume true; {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:32,725 INFO L273 TraceCheckUtils]: 43: Hoare triple {9985#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:32,725 INFO L273 TraceCheckUtils]: 44: Hoare triple {9985#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:32,726 INFO L273 TraceCheckUtils]: 45: Hoare triple {9985#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:32,727 INFO L273 TraceCheckUtils]: 46: Hoare triple {9986#(<= main_~a~0 10)} assume true; {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:32,727 INFO L273 TraceCheckUtils]: 47: Hoare triple {9986#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:32,728 INFO L273 TraceCheckUtils]: 48: Hoare triple {9986#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:32,728 INFO L273 TraceCheckUtils]: 49: Hoare triple {9986#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:32,729 INFO L273 TraceCheckUtils]: 50: Hoare triple {9987#(<= main_~a~0 11)} assume true; {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:32,729 INFO L273 TraceCheckUtils]: 51: Hoare triple {9987#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:32,730 INFO L273 TraceCheckUtils]: 52: Hoare triple {9987#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:32,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {9987#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:32,731 INFO L273 TraceCheckUtils]: 54: Hoare triple {9988#(<= main_~a~0 12)} assume true; {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:32,732 INFO L273 TraceCheckUtils]: 55: Hoare triple {9988#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:32,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {9988#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:32,733 INFO L273 TraceCheckUtils]: 57: Hoare triple {9988#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:32,733 INFO L273 TraceCheckUtils]: 58: Hoare triple {9989#(<= main_~a~0 13)} assume true; {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:32,734 INFO L273 TraceCheckUtils]: 59: Hoare triple {9989#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:32,735 INFO L273 TraceCheckUtils]: 60: Hoare triple {9989#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:32,735 INFO L273 TraceCheckUtils]: 61: Hoare triple {9989#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {9990#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:32,736 INFO L273 TraceCheckUtils]: 62: Hoare triple {9990#(<= main_~a~0 14)} assume true; {9990#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:32,736 INFO L273 TraceCheckUtils]: 63: Hoare triple {9990#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-14 18:40:32,737 INFO L273 TraceCheckUtils]: 64: Hoare triple {9975#false} ~a~0 := 0; {9975#false} is VALID [2018-11-14 18:40:32,737 INFO L273 TraceCheckUtils]: 65: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,737 INFO L273 TraceCheckUtils]: 66: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,737 INFO L273 TraceCheckUtils]: 67: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,737 INFO L273 TraceCheckUtils]: 68: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,738 INFO L273 TraceCheckUtils]: 69: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,738 INFO L273 TraceCheckUtils]: 70: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,738 INFO L273 TraceCheckUtils]: 71: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,739 INFO L273 TraceCheckUtils]: 74: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,739 INFO L273 TraceCheckUtils]: 75: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,739 INFO L273 TraceCheckUtils]: 76: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,739 INFO L273 TraceCheckUtils]: 77: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,739 INFO L273 TraceCheckUtils]: 78: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,739 INFO L273 TraceCheckUtils]: 79: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 80: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 81: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 82: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 83: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 84: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 85: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 86: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 87: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,740 INFO L273 TraceCheckUtils]: 88: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 89: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 90: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 91: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 92: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 93: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 94: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 95: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 96: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,741 INFO L273 TraceCheckUtils]: 97: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 98: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 99: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 100: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 101: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 102: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 103: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 104: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,742 INFO L273 TraceCheckUtils]: 105: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 106: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 107: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 108: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 109: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 110: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 111: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 112: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 113: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,743 INFO L273 TraceCheckUtils]: 114: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 115: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 116: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 117: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 118: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 119: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 120: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 121: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 122: Hoare triple {9975#false} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-14 18:40:32,744 INFO L273 TraceCheckUtils]: 123: Hoare triple {9975#false} havoc ~x~0;~x~0 := 0; {9975#false} is VALID [2018-11-14 18:40:32,745 INFO L273 TraceCheckUtils]: 124: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:32,745 INFO L273 TraceCheckUtils]: 125: Hoare triple {9975#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:32,745 INFO L256 TraceCheckUtils]: 126: Hoare triple {9975#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {9975#false} is VALID [2018-11-14 18:40:32,745 INFO L273 TraceCheckUtils]: 127: Hoare triple {9975#false} ~cond := #in~cond; {9975#false} is VALID [2018-11-14 18:40:32,745 INFO L273 TraceCheckUtils]: 128: Hoare triple {9975#false} assume ~cond == 0; {9975#false} is VALID [2018-11-14 18:40:32,745 INFO L273 TraceCheckUtils]: 129: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2018-11-14 18:40:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-14 18:40:32,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:32,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:40:32,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:40:32,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:32,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:33,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2018-11-14 18:40:33,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {9974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9974#true} is VALID [2018-11-14 18:40:33,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2018-11-14 18:40:33,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #95#return; {9974#true} is VALID [2018-11-14 18:40:33,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret8 := main(); {9974#true} is VALID [2018-11-14 18:40:33,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {9974#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {10009#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:33,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(<= main_~a~0 0)} assume true; {10009#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:33,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {10009#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {10009#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:33,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {10009#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {10009#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:33,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {10009#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:33,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {9977#(<= main_~a~0 1)} assume true; {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:33,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {9977#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:33,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {9977#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9977#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:33,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {9977#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:33,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {9978#(<= main_~a~0 2)} assume true; {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:33,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {9978#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:33,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {9978#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9978#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:33,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {9978#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:33,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {9979#(<= main_~a~0 3)} assume true; {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:33,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {9979#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:33,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {9979#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9979#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:33,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {9979#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:33,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {9980#(<= main_~a~0 4)} assume true; {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:33,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {9980#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:33,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {9980#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9980#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:33,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {9980#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:33,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {9981#(<= main_~a~0 5)} assume true; {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:33,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {9981#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:33,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {9981#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9981#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:33,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {9981#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:33,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {9982#(<= main_~a~0 6)} assume true; {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:33,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {9982#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:33,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {9982#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9982#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:33,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {9982#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:33,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {9983#(<= main_~a~0 7)} assume true; {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:33,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {9983#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:33,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {9983#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9983#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:33,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {9983#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:33,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {9984#(<= main_~a~0 8)} assume true; {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:33,157 INFO L273 TraceCheckUtils]: 39: Hoare triple {9984#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:33,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {9984#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9984#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:33,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {9984#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:33,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {9985#(<= main_~a~0 9)} assume true; {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:33,160 INFO L273 TraceCheckUtils]: 43: Hoare triple {9985#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:33,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {9985#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9985#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:33,161 INFO L273 TraceCheckUtils]: 45: Hoare triple {9985#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:33,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {9986#(<= main_~a~0 10)} assume true; {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:33,162 INFO L273 TraceCheckUtils]: 47: Hoare triple {9986#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:33,163 INFO L273 TraceCheckUtils]: 48: Hoare triple {9986#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9986#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:33,163 INFO L273 TraceCheckUtils]: 49: Hoare triple {9986#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:33,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {9987#(<= main_~a~0 11)} assume true; {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:33,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {9987#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:33,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {9987#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9987#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:33,166 INFO L273 TraceCheckUtils]: 53: Hoare triple {9987#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:33,166 INFO L273 TraceCheckUtils]: 54: Hoare triple {9988#(<= main_~a~0 12)} assume true; {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:33,167 INFO L273 TraceCheckUtils]: 55: Hoare triple {9988#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:33,167 INFO L273 TraceCheckUtils]: 56: Hoare triple {9988#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9988#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:33,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {9988#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:33,168 INFO L273 TraceCheckUtils]: 58: Hoare triple {9989#(<= main_~a~0 13)} assume true; {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:33,169 INFO L273 TraceCheckUtils]: 59: Hoare triple {9989#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:33,169 INFO L273 TraceCheckUtils]: 60: Hoare triple {9989#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {9989#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:33,170 INFO L273 TraceCheckUtils]: 61: Hoare triple {9989#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {9990#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:33,171 INFO L273 TraceCheckUtils]: 62: Hoare triple {9990#(<= main_~a~0 14)} assume true; {9990#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:33,171 INFO L273 TraceCheckUtils]: 63: Hoare triple {9990#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-14 18:40:33,172 INFO L273 TraceCheckUtils]: 64: Hoare triple {9975#false} ~a~0 := 0; {9975#false} is VALID [2018-11-14 18:40:33,172 INFO L273 TraceCheckUtils]: 65: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,172 INFO L273 TraceCheckUtils]: 67: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,172 INFO L273 TraceCheckUtils]: 68: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,173 INFO L273 TraceCheckUtils]: 69: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,173 INFO L273 TraceCheckUtils]: 70: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,173 INFO L273 TraceCheckUtils]: 71: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 74: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 75: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 76: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 77: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 78: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 79: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 80: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,174 INFO L273 TraceCheckUtils]: 81: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 82: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 83: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 84: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 85: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 86: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 87: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 89: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,175 INFO L273 TraceCheckUtils]: 90: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 91: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 92: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 93: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 94: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 95: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 96: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 97: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 98: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,176 INFO L273 TraceCheckUtils]: 99: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 100: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 101: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 102: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 103: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 104: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 105: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 106: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 107: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,177 INFO L273 TraceCheckUtils]: 108: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 109: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 110: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 111: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 112: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 113: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 114: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 115: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 116: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,178 INFO L273 TraceCheckUtils]: 117: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 118: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 119: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 120: Hoare triple {9975#false} ~a~0 := ~a~0 + 1; {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 122: Hoare triple {9975#false} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 123: Hoare triple {9975#false} havoc ~x~0;~x~0 := 0; {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 124: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-14 18:40:33,179 INFO L273 TraceCheckUtils]: 125: Hoare triple {9975#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {9975#false} is VALID [2018-11-14 18:40:33,180 INFO L256 TraceCheckUtils]: 126: Hoare triple {9975#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {9975#false} is VALID [2018-11-14 18:40:33,180 INFO L273 TraceCheckUtils]: 127: Hoare triple {9975#false} ~cond := #in~cond; {9975#false} is VALID [2018-11-14 18:40:33,180 INFO L273 TraceCheckUtils]: 128: Hoare triple {9975#false} assume ~cond == 0; {9975#false} is VALID [2018-11-14 18:40:33,180 INFO L273 TraceCheckUtils]: 129: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2018-11-14 18:40:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-14 18:40:33,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:33,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:40:33,209 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 130 [2018-11-14 18:40:33,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:33,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:40:33,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:33,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:40:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:40:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:40:33,286 INFO L87 Difference]: Start difference. First operand 141 states and 173 transitions. Second operand 18 states. [2018-11-14 18:40:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:33,899 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2018-11-14 18:40:33,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:40:33,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 130 [2018-11-14 18:40:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:40:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 218 transitions. [2018-11-14 18:40:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:40:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 218 transitions. [2018-11-14 18:40:33,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 218 transitions. [2018-11-14 18:40:34,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:34,116 INFO L225 Difference]: With dead ends: 230 [2018-11-14 18:40:34,116 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 18:40:34,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:40:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 18:40:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-11-14 18:40:34,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:34,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 149 states. [2018-11-14 18:40:34,150 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 149 states. [2018-11-14 18:40:34,150 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 149 states. [2018-11-14 18:40:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:34,153 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-11-14 18:40:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 189 transitions. [2018-11-14 18:40:34,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:34,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:34,154 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 153 states. [2018-11-14 18:40:34,154 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 153 states. [2018-11-14 18:40:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:34,157 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-11-14 18:40:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 189 transitions. [2018-11-14 18:40:34,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:34,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:34,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:34,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 18:40:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2018-11-14 18:40:34,161 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 130 [2018-11-14 18:40:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:34,161 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2018-11-14 18:40:34,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:40:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2018-11-14 18:40:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-14 18:40:34,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:34,163 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:34,163 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:34,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash 128497875, now seen corresponding path program 15 times [2018-11-14 18:40:34,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:34,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:34,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:34,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:34,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {11168#true} call ULTIMATE.init(); {11168#true} is VALID [2018-11-14 18:40:34,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {11168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11168#true} is VALID [2018-11-14 18:40:34,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:34,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11168#true} {11168#true} #95#return; {11168#true} is VALID [2018-11-14 18:40:34,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {11168#true} call #t~ret8 := main(); {11168#true} is VALID [2018-11-14 18:40:34,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {11168#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {11170#(= main_~a~0 0)} is VALID [2018-11-14 18:40:34,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {11170#(= main_~a~0 0)} assume true; {11170#(= main_~a~0 0)} is VALID [2018-11-14 18:40:34,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {11170#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11170#(= main_~a~0 0)} is VALID [2018-11-14 18:40:34,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {11170#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11170#(= main_~a~0 0)} is VALID [2018-11-14 18:40:34,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {11170#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:34,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {11171#(<= main_~a~0 1)} assume true; {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:34,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {11171#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:34,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {11171#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:34,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {11171#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:34,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {11172#(<= main_~a~0 2)} assume true; {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:34,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {11172#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:34,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {11172#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:34,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {11172#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:34,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {11173#(<= main_~a~0 3)} assume true; {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:34,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {11173#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:34,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {11173#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:34,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {11173#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:34,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {11174#(<= main_~a~0 4)} assume true; {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:34,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {11174#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:34,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {11174#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:34,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {11174#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:34,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {11175#(<= main_~a~0 5)} assume true; {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:34,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {11175#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:34,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {11175#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:34,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {11175#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:34,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {11176#(<= main_~a~0 6)} assume true; {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:34,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {11176#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:34,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {11176#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:34,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {11176#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:34,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {11177#(<= main_~a~0 7)} assume true; {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:34,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {11177#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:34,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {11177#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:34,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {11177#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:34,658 INFO L273 TraceCheckUtils]: 38: Hoare triple {11178#(<= main_~a~0 8)} assume true; {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:34,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {11178#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:34,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {11178#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:34,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {11178#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:34,661 INFO L273 TraceCheckUtils]: 42: Hoare triple {11179#(<= main_~a~0 9)} assume true; {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:34,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {11179#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:34,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {11179#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:34,662 INFO L273 TraceCheckUtils]: 45: Hoare triple {11179#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:34,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {11180#(<= main_~a~0 10)} assume true; {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:34,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {11180#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:34,664 INFO L273 TraceCheckUtils]: 48: Hoare triple {11180#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:34,665 INFO L273 TraceCheckUtils]: 49: Hoare triple {11180#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:34,665 INFO L273 TraceCheckUtils]: 50: Hoare triple {11181#(<= main_~a~0 11)} assume true; {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:34,666 INFO L273 TraceCheckUtils]: 51: Hoare triple {11181#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:34,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {11181#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:34,667 INFO L273 TraceCheckUtils]: 53: Hoare triple {11181#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:34,667 INFO L273 TraceCheckUtils]: 54: Hoare triple {11182#(<= main_~a~0 12)} assume true; {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:34,668 INFO L273 TraceCheckUtils]: 55: Hoare triple {11182#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:34,669 INFO L273 TraceCheckUtils]: 56: Hoare triple {11182#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:34,669 INFO L273 TraceCheckUtils]: 57: Hoare triple {11182#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:34,670 INFO L273 TraceCheckUtils]: 58: Hoare triple {11183#(<= main_~a~0 13)} assume true; {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:34,670 INFO L273 TraceCheckUtils]: 59: Hoare triple {11183#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:34,671 INFO L273 TraceCheckUtils]: 60: Hoare triple {11183#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:34,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {11183#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:34,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {11184#(<= main_~a~0 14)} assume true; {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:34,673 INFO L273 TraceCheckUtils]: 63: Hoare triple {11184#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:34,673 INFO L273 TraceCheckUtils]: 64: Hoare triple {11184#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:34,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {11184#(<= main_~a~0 14)} ~a~0 := ~a~0 + 1; {11185#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:34,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {11185#(<= main_~a~0 15)} assume true; {11185#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:34,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {11185#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11169#false} is VALID [2018-11-14 18:40:34,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {11169#false} ~a~0 := 0; {11169#false} is VALID [2018-11-14 18:40:34,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,677 INFO L273 TraceCheckUtils]: 74: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,678 INFO L273 TraceCheckUtils]: 79: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,678 INFO L273 TraceCheckUtils]: 80: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,678 INFO L273 TraceCheckUtils]: 81: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,679 INFO L273 TraceCheckUtils]: 86: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,679 INFO L273 TraceCheckUtils]: 87: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,679 INFO L273 TraceCheckUtils]: 88: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 89: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 90: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 91: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 92: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 93: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 94: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 96: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,680 INFO L273 TraceCheckUtils]: 97: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 98: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 99: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 100: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 101: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 102: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 103: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 104: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 105: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,681 INFO L273 TraceCheckUtils]: 106: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 107: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 108: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 109: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 110: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 111: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 112: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 113: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 114: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,682 INFO L273 TraceCheckUtils]: 115: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 116: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 117: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 118: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 119: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 120: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 121: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 122: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 123: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,683 INFO L273 TraceCheckUtils]: 124: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 125: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 126: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 127: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 128: Hoare triple {11169#false} ~a~0 := ~a~0 + 1; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 129: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 130: Hoare triple {11169#false} assume !(~a~0 < 100000); {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 131: Hoare triple {11169#false} havoc ~x~0;~x~0 := 0; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 132: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:34,684 INFO L273 TraceCheckUtils]: 133: Hoare triple {11169#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:34,685 INFO L256 TraceCheckUtils]: 134: Hoare triple {11169#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {11169#false} is VALID [2018-11-14 18:40:34,685 INFO L273 TraceCheckUtils]: 135: Hoare triple {11169#false} ~cond := #in~cond; {11169#false} is VALID [2018-11-14 18:40:34,685 INFO L273 TraceCheckUtils]: 136: Hoare triple {11169#false} assume ~cond == 0; {11169#false} is VALID [2018-11-14 18:40:34,685 INFO L273 TraceCheckUtils]: 137: Hoare triple {11169#false} assume !false; {11169#false} is VALID [2018-11-14 18:40:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-14 18:40:34,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:34,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:34,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:40:37,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 18:40:37,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:37,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:37,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {11168#true} call ULTIMATE.init(); {11168#true} is VALID [2018-11-14 18:40:37,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {11168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11168#true} is VALID [2018-11-14 18:40:37,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11168#true} {11168#true} #95#return; {11168#true} is VALID [2018-11-14 18:40:37,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {11168#true} call #t~ret8 := main(); {11168#true} is VALID [2018-11-14 18:40:37,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {11168#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {11168#true} is VALID [2018-11-14 18:40:37,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 17: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 41: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 48: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 49: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 56: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 57: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 62: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,848 INFO L273 TraceCheckUtils]: 63: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11168#true} is VALID [2018-11-14 18:40:37,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,849 INFO L273 TraceCheckUtils]: 65: Hoare triple {11168#true} ~a~0 := ~a~0 + 1; {11168#true} is VALID [2018-11-14 18:40:37,849 INFO L273 TraceCheckUtils]: 66: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-14 18:40:37,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {11168#true} assume !(~a~0 < 100000); {11168#true} is VALID [2018-11-14 18:40:37,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {11168#true} ~a~0 := 0; {11393#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:37,850 INFO L273 TraceCheckUtils]: 69: Hoare triple {11393#(<= main_~a~0 0)} assume true; {11393#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:37,850 INFO L273 TraceCheckUtils]: 70: Hoare triple {11393#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11393#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:37,850 INFO L273 TraceCheckUtils]: 71: Hoare triple {11393#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11393#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:37,851 INFO L273 TraceCheckUtils]: 72: Hoare triple {11393#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:37,851 INFO L273 TraceCheckUtils]: 73: Hoare triple {11171#(<= main_~a~0 1)} assume true; {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:37,851 INFO L273 TraceCheckUtils]: 74: Hoare triple {11171#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:37,852 INFO L273 TraceCheckUtils]: 75: Hoare triple {11171#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11171#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:37,852 INFO L273 TraceCheckUtils]: 76: Hoare triple {11171#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:37,852 INFO L273 TraceCheckUtils]: 77: Hoare triple {11172#(<= main_~a~0 2)} assume true; {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:37,853 INFO L273 TraceCheckUtils]: 78: Hoare triple {11172#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:37,853 INFO L273 TraceCheckUtils]: 79: Hoare triple {11172#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11172#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:37,854 INFO L273 TraceCheckUtils]: 80: Hoare triple {11172#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:37,854 INFO L273 TraceCheckUtils]: 81: Hoare triple {11173#(<= main_~a~0 3)} assume true; {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:37,855 INFO L273 TraceCheckUtils]: 82: Hoare triple {11173#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:37,855 INFO L273 TraceCheckUtils]: 83: Hoare triple {11173#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11173#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:37,856 INFO L273 TraceCheckUtils]: 84: Hoare triple {11173#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:37,857 INFO L273 TraceCheckUtils]: 85: Hoare triple {11174#(<= main_~a~0 4)} assume true; {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:37,857 INFO L273 TraceCheckUtils]: 86: Hoare triple {11174#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:37,858 INFO L273 TraceCheckUtils]: 87: Hoare triple {11174#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11174#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:37,859 INFO L273 TraceCheckUtils]: 88: Hoare triple {11174#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:37,859 INFO L273 TraceCheckUtils]: 89: Hoare triple {11175#(<= main_~a~0 5)} assume true; {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:37,860 INFO L273 TraceCheckUtils]: 90: Hoare triple {11175#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:37,860 INFO L273 TraceCheckUtils]: 91: Hoare triple {11175#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11175#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:37,861 INFO L273 TraceCheckUtils]: 92: Hoare triple {11175#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:37,861 INFO L273 TraceCheckUtils]: 93: Hoare triple {11176#(<= main_~a~0 6)} assume true; {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:37,862 INFO L273 TraceCheckUtils]: 94: Hoare triple {11176#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:37,862 INFO L273 TraceCheckUtils]: 95: Hoare triple {11176#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11176#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:37,863 INFO L273 TraceCheckUtils]: 96: Hoare triple {11176#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:37,864 INFO L273 TraceCheckUtils]: 97: Hoare triple {11177#(<= main_~a~0 7)} assume true; {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:37,864 INFO L273 TraceCheckUtils]: 98: Hoare triple {11177#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:37,865 INFO L273 TraceCheckUtils]: 99: Hoare triple {11177#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11177#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:37,865 INFO L273 TraceCheckUtils]: 100: Hoare triple {11177#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:37,868 INFO L273 TraceCheckUtils]: 101: Hoare triple {11178#(<= main_~a~0 8)} assume true; {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:37,868 INFO L273 TraceCheckUtils]: 102: Hoare triple {11178#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:37,869 INFO L273 TraceCheckUtils]: 103: Hoare triple {11178#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11178#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:37,870 INFO L273 TraceCheckUtils]: 104: Hoare triple {11178#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:37,870 INFO L273 TraceCheckUtils]: 105: Hoare triple {11179#(<= main_~a~0 9)} assume true; {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:37,871 INFO L273 TraceCheckUtils]: 106: Hoare triple {11179#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:37,871 INFO L273 TraceCheckUtils]: 107: Hoare triple {11179#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11179#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:37,872 INFO L273 TraceCheckUtils]: 108: Hoare triple {11179#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:37,872 INFO L273 TraceCheckUtils]: 109: Hoare triple {11180#(<= main_~a~0 10)} assume true; {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:37,873 INFO L273 TraceCheckUtils]: 110: Hoare triple {11180#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:37,873 INFO L273 TraceCheckUtils]: 111: Hoare triple {11180#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11180#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:37,874 INFO L273 TraceCheckUtils]: 112: Hoare triple {11180#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:37,875 INFO L273 TraceCheckUtils]: 113: Hoare triple {11181#(<= main_~a~0 11)} assume true; {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:37,875 INFO L273 TraceCheckUtils]: 114: Hoare triple {11181#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:37,876 INFO L273 TraceCheckUtils]: 115: Hoare triple {11181#(<= main_~a~0 11)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11181#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:37,877 INFO L273 TraceCheckUtils]: 116: Hoare triple {11181#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:37,877 INFO L273 TraceCheckUtils]: 117: Hoare triple {11182#(<= main_~a~0 12)} assume true; {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:37,878 INFO L273 TraceCheckUtils]: 118: Hoare triple {11182#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:37,878 INFO L273 TraceCheckUtils]: 119: Hoare triple {11182#(<= main_~a~0 12)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11182#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:37,879 INFO L273 TraceCheckUtils]: 120: Hoare triple {11182#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:37,879 INFO L273 TraceCheckUtils]: 121: Hoare triple {11183#(<= main_~a~0 13)} assume true; {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:37,880 INFO L273 TraceCheckUtils]: 122: Hoare triple {11183#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:37,880 INFO L273 TraceCheckUtils]: 123: Hoare triple {11183#(<= main_~a~0 13)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11183#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:37,881 INFO L273 TraceCheckUtils]: 124: Hoare triple {11183#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:37,882 INFO L273 TraceCheckUtils]: 125: Hoare triple {11184#(<= main_~a~0 14)} assume true; {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:37,882 INFO L273 TraceCheckUtils]: 126: Hoare triple {11184#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:37,883 INFO L273 TraceCheckUtils]: 127: Hoare triple {11184#(<= main_~a~0 14)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {11184#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:37,883 INFO L273 TraceCheckUtils]: 128: Hoare triple {11184#(<= main_~a~0 14)} ~a~0 := ~a~0 + 1; {11185#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:37,884 INFO L273 TraceCheckUtils]: 129: Hoare triple {11185#(<= main_~a~0 15)} assume true; {11185#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:37,885 INFO L273 TraceCheckUtils]: 130: Hoare triple {11185#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11169#false} is VALID [2018-11-14 18:40:37,885 INFO L273 TraceCheckUtils]: 131: Hoare triple {11169#false} havoc ~x~0;~x~0 := 0; {11169#false} is VALID [2018-11-14 18:40:37,885 INFO L273 TraceCheckUtils]: 132: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-14 18:40:37,885 INFO L273 TraceCheckUtils]: 133: Hoare triple {11169#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {11169#false} is VALID [2018-11-14 18:40:37,885 INFO L256 TraceCheckUtils]: 134: Hoare triple {11169#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {11169#false} is VALID [2018-11-14 18:40:37,886 INFO L273 TraceCheckUtils]: 135: Hoare triple {11169#false} ~cond := #in~cond; {11169#false} is VALID [2018-11-14 18:40:37,886 INFO L273 TraceCheckUtils]: 136: Hoare triple {11169#false} assume ~cond == 0; {11169#false} is VALID [2018-11-14 18:40:37,886 INFO L273 TraceCheckUtils]: 137: Hoare triple {11169#false} assume !false; {11169#false} is VALID [2018-11-14 18:40:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-14 18:40:37,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:37,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 18:40:37,921 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 138 [2018-11-14 18:40:37,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:37,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:40:38,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:38,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:40:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:40:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:40:38,081 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand 19 states. [2018-11-14 18:40:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:38,756 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2018-11-14 18:40:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:40:38,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 138 [2018-11-14 18:40:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:40:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 228 transitions. [2018-11-14 18:40:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:40:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 228 transitions. [2018-11-14 18:40:38,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 228 transitions. [2018-11-14 18:40:38,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:38,970 INFO L225 Difference]: With dead ends: 242 [2018-11-14 18:40:38,971 INFO L226 Difference]: Without dead ends: 161 [2018-11-14 18:40:38,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:40:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-14 18:40:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-11-14 18:40:39,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:39,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 157 states. [2018-11-14 18:40:39,020 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 157 states. [2018-11-14 18:40:39,021 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 157 states. [2018-11-14 18:40:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:39,025 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2018-11-14 18:40:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-11-14 18:40:39,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:39,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:39,026 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 161 states. [2018-11-14 18:40:39,026 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 161 states. [2018-11-14 18:40:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:39,029 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2018-11-14 18:40:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-11-14 18:40:39,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:39,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:39,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:39,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-14 18:40:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2018-11-14 18:40:39,033 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 138 [2018-11-14 18:40:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:39,033 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2018-11-14 18:40:39,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:40:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2018-11-14 18:40:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-14 18:40:39,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:39,034 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:39,034 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:39,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -27310637, now seen corresponding path program 16 times [2018-11-14 18:40:39,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:39,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:39,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:39,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:39,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {12428#true} call ULTIMATE.init(); {12428#true} is VALID [2018-11-14 18:40:39,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {12428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12428#true} is VALID [2018-11-14 18:40:39,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {12428#true} assume true; {12428#true} is VALID [2018-11-14 18:40:39,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12428#true} {12428#true} #95#return; {12428#true} is VALID [2018-11-14 18:40:39,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {12428#true} call #t~ret8 := main(); {12428#true} is VALID [2018-11-14 18:40:39,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {12428#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {12430#(= main_~a~0 0)} is VALID [2018-11-14 18:40:39,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {12430#(= main_~a~0 0)} assume true; {12430#(= main_~a~0 0)} is VALID [2018-11-14 18:40:39,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {12430#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12430#(= main_~a~0 0)} is VALID [2018-11-14 18:40:39,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {12430#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12430#(= main_~a~0 0)} is VALID [2018-11-14 18:40:39,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {12430#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:39,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {12431#(<= main_~a~0 1)} assume true; {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:39,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {12431#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:39,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {12431#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:39,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {12431#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:39,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {12432#(<= main_~a~0 2)} assume true; {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:39,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {12432#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:39,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {12432#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:39,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {12432#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:39,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {12433#(<= main_~a~0 3)} assume true; {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:39,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {12433#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:39,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {12433#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:39,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {12433#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:39,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {12434#(<= main_~a~0 4)} assume true; {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:39,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {12434#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:39,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {12434#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:39,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {12434#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:39,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {12435#(<= main_~a~0 5)} assume true; {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:39,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {12435#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:39,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {12435#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:39,765 INFO L273 TraceCheckUtils]: 29: Hoare triple {12435#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:39,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {12436#(<= main_~a~0 6)} assume true; {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:39,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {12436#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:39,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {12436#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:39,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {12436#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:39,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {12437#(<= main_~a~0 7)} assume true; {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:39,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {12437#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:39,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {12437#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:39,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {12437#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:39,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {12438#(<= main_~a~0 8)} assume true; {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:39,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {12438#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:39,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {12438#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:39,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {12438#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:39,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {12439#(<= main_~a~0 9)} assume true; {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:39,770 INFO L273 TraceCheckUtils]: 43: Hoare triple {12439#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:39,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {12439#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:39,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {12439#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:39,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {12440#(<= main_~a~0 10)} assume true; {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:39,773 INFO L273 TraceCheckUtils]: 47: Hoare triple {12440#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:39,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {12440#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:39,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {12440#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:39,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {12441#(<= main_~a~0 11)} assume true; {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:39,775 INFO L273 TraceCheckUtils]: 51: Hoare triple {12441#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:39,775 INFO L273 TraceCheckUtils]: 52: Hoare triple {12441#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:39,776 INFO L273 TraceCheckUtils]: 53: Hoare triple {12441#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:39,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {12442#(<= main_~a~0 12)} assume true; {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:39,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {12442#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:39,778 INFO L273 TraceCheckUtils]: 56: Hoare triple {12442#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:39,778 INFO L273 TraceCheckUtils]: 57: Hoare triple {12442#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:39,779 INFO L273 TraceCheckUtils]: 58: Hoare triple {12443#(<= main_~a~0 13)} assume true; {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:39,779 INFO L273 TraceCheckUtils]: 59: Hoare triple {12443#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:39,780 INFO L273 TraceCheckUtils]: 60: Hoare triple {12443#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:39,781 INFO L273 TraceCheckUtils]: 61: Hoare triple {12443#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:39,781 INFO L273 TraceCheckUtils]: 62: Hoare triple {12444#(<= main_~a~0 14)} assume true; {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:39,782 INFO L273 TraceCheckUtils]: 63: Hoare triple {12444#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:39,782 INFO L273 TraceCheckUtils]: 64: Hoare triple {12444#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:39,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {12444#(<= main_~a~0 14)} ~a~0 := ~a~0 + 1; {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:39,784 INFO L273 TraceCheckUtils]: 66: Hoare triple {12445#(<= main_~a~0 15)} assume true; {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:39,784 INFO L273 TraceCheckUtils]: 67: Hoare triple {12445#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:39,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {12445#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:39,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {12445#(<= main_~a~0 15)} ~a~0 := ~a~0 + 1; {12446#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:39,786 INFO L273 TraceCheckUtils]: 70: Hoare triple {12446#(<= main_~a~0 16)} assume true; {12446#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:39,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {12446#(<= main_~a~0 16)} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-14 18:40:39,787 INFO L273 TraceCheckUtils]: 72: Hoare triple {12429#false} ~a~0 := 0; {12429#false} is VALID [2018-11-14 18:40:39,787 INFO L273 TraceCheckUtils]: 73: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,788 INFO L273 TraceCheckUtils]: 79: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,788 INFO L273 TraceCheckUtils]: 81: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 82: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 83: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 84: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 85: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 86: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 89: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,789 INFO L273 TraceCheckUtils]: 90: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 91: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 92: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 93: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 94: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 95: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 96: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 97: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 98: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 100: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 101: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 102: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 103: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 104: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 105: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 106: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 107: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,791 INFO L273 TraceCheckUtils]: 108: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 109: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 110: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 111: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 112: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 113: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 115: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 116: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,792 INFO L273 TraceCheckUtils]: 117: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 118: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 119: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 120: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 121: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 122: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 123: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 124: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 127: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 128: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 129: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 130: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 131: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 132: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 133: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,794 INFO L273 TraceCheckUtils]: 134: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 135: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 136: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 137: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 138: Hoare triple {12429#false} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 139: Hoare triple {12429#false} havoc ~x~0;~x~0 := 0; {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 140: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 141: Hoare triple {12429#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L256 TraceCheckUtils]: 142: Hoare triple {12429#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {12429#false} is VALID [2018-11-14 18:40:39,795 INFO L273 TraceCheckUtils]: 143: Hoare triple {12429#false} ~cond := #in~cond; {12429#false} is VALID [2018-11-14 18:40:39,796 INFO L273 TraceCheckUtils]: 144: Hoare triple {12429#false} assume ~cond == 0; {12429#false} is VALID [2018-11-14 18:40:39,796 INFO L273 TraceCheckUtils]: 145: Hoare triple {12429#false} assume !false; {12429#false} is VALID [2018-11-14 18:40:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-14 18:40:39,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:39,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:39,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:40:40,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:40:40,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:40,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:40,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {12428#true} call ULTIMATE.init(); {12428#true} is VALID [2018-11-14 18:40:40,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {12428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12428#true} is VALID [2018-11-14 18:40:40,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {12428#true} assume true; {12428#true} is VALID [2018-11-14 18:40:40,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12428#true} {12428#true} #95#return; {12428#true} is VALID [2018-11-14 18:40:40,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {12428#true} call #t~ret8 := main(); {12428#true} is VALID [2018-11-14 18:40:40,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {12428#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {12465#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:40,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {12465#(<= main_~a~0 0)} assume true; {12465#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:40,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {12465#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12465#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:40,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {12465#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12465#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:40,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {12465#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:40,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {12431#(<= main_~a~0 1)} assume true; {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:40,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {12431#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:40,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {12431#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12431#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:40,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {12431#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:40,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {12432#(<= main_~a~0 2)} assume true; {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:40,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {12432#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:40,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {12432#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12432#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:40,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {12432#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:40,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {12433#(<= main_~a~0 3)} assume true; {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:40,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {12433#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:40,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {12433#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12433#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:40,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {12433#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:40,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {12434#(<= main_~a~0 4)} assume true; {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:40,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {12434#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:40,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {12434#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12434#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:40,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {12434#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:40,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {12435#(<= main_~a~0 5)} assume true; {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:40,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {12435#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:40,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {12435#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12435#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:40,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {12435#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:40,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {12436#(<= main_~a~0 6)} assume true; {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:40,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {12436#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:40,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {12436#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12436#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:40,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {12436#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:40,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {12437#(<= main_~a~0 7)} assume true; {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:40,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {12437#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:40,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {12437#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12437#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:40,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {12437#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:40,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {12438#(<= main_~a~0 8)} assume true; {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:40,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {12438#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:40,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {12438#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12438#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:40,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {12438#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:40,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {12439#(<= main_~a~0 9)} assume true; {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:40,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {12439#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:40,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {12439#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12439#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:40,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {12439#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:40,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {12440#(<= main_~a~0 10)} assume true; {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:40,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {12440#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:40,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {12440#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12440#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:40,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {12440#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:40,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {12441#(<= main_~a~0 11)} assume true; {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:40,817 INFO L273 TraceCheckUtils]: 51: Hoare triple {12441#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:40,819 INFO L273 TraceCheckUtils]: 52: Hoare triple {12441#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12441#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:40,819 INFO L273 TraceCheckUtils]: 53: Hoare triple {12441#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:40,821 INFO L273 TraceCheckUtils]: 54: Hoare triple {12442#(<= main_~a~0 12)} assume true; {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:40,821 INFO L273 TraceCheckUtils]: 55: Hoare triple {12442#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:40,824 INFO L273 TraceCheckUtils]: 56: Hoare triple {12442#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12442#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:40,824 INFO L273 TraceCheckUtils]: 57: Hoare triple {12442#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:40,826 INFO L273 TraceCheckUtils]: 58: Hoare triple {12443#(<= main_~a~0 13)} assume true; {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:40,826 INFO L273 TraceCheckUtils]: 59: Hoare triple {12443#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:40,829 INFO L273 TraceCheckUtils]: 60: Hoare triple {12443#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12443#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:40,829 INFO L273 TraceCheckUtils]: 61: Hoare triple {12443#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:40,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {12444#(<= main_~a~0 14)} assume true; {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:40,831 INFO L273 TraceCheckUtils]: 63: Hoare triple {12444#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:40,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {12444#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12444#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:40,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {12444#(<= main_~a~0 14)} ~a~0 := ~a~0 + 1; {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:40,837 INFO L273 TraceCheckUtils]: 66: Hoare triple {12445#(<= main_~a~0 15)} assume true; {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:40,837 INFO L273 TraceCheckUtils]: 67: Hoare triple {12445#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:40,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {12445#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {12445#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:40,845 INFO L273 TraceCheckUtils]: 69: Hoare triple {12445#(<= main_~a~0 15)} ~a~0 := ~a~0 + 1; {12446#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:40,847 INFO L273 TraceCheckUtils]: 70: Hoare triple {12446#(<= main_~a~0 16)} assume true; {12446#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:40,847 INFO L273 TraceCheckUtils]: 71: Hoare triple {12446#(<= main_~a~0 16)} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-14 18:40:40,847 INFO L273 TraceCheckUtils]: 72: Hoare triple {12429#false} ~a~0 := 0; {12429#false} is VALID [2018-11-14 18:40:40,847 INFO L273 TraceCheckUtils]: 73: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 74: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 75: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 76: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 77: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 78: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 79: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 80: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 81: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,848 INFO L273 TraceCheckUtils]: 82: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 83: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 84: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 85: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 86: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 87: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 88: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 89: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 90: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,849 INFO L273 TraceCheckUtils]: 91: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 92: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 93: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 94: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 95: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 96: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 97: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,850 INFO L273 TraceCheckUtils]: 98: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,851 INFO L273 TraceCheckUtils]: 99: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,851 INFO L273 TraceCheckUtils]: 100: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,851 INFO L273 TraceCheckUtils]: 101: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,851 INFO L273 TraceCheckUtils]: 102: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,851 INFO L273 TraceCheckUtils]: 103: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,851 INFO L273 TraceCheckUtils]: 104: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,852 INFO L273 TraceCheckUtils]: 105: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,852 INFO L273 TraceCheckUtils]: 106: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,852 INFO L273 TraceCheckUtils]: 107: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,852 INFO L273 TraceCheckUtils]: 108: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,852 INFO L273 TraceCheckUtils]: 109: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,852 INFO L273 TraceCheckUtils]: 110: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,853 INFO L273 TraceCheckUtils]: 111: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,853 INFO L273 TraceCheckUtils]: 112: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,853 INFO L273 TraceCheckUtils]: 113: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,853 INFO L273 TraceCheckUtils]: 114: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,853 INFO L273 TraceCheckUtils]: 115: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,853 INFO L273 TraceCheckUtils]: 116: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,854 INFO L273 TraceCheckUtils]: 117: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,854 INFO L273 TraceCheckUtils]: 118: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,854 INFO L273 TraceCheckUtils]: 119: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,854 INFO L273 TraceCheckUtils]: 120: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,854 INFO L273 TraceCheckUtils]: 121: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,854 INFO L273 TraceCheckUtils]: 122: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,855 INFO L273 TraceCheckUtils]: 123: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,855 INFO L273 TraceCheckUtils]: 124: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,855 INFO L273 TraceCheckUtils]: 125: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,855 INFO L273 TraceCheckUtils]: 126: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,855 INFO L273 TraceCheckUtils]: 127: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,855 INFO L273 TraceCheckUtils]: 128: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,856 INFO L273 TraceCheckUtils]: 129: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,856 INFO L273 TraceCheckUtils]: 130: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,856 INFO L273 TraceCheckUtils]: 131: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,856 INFO L273 TraceCheckUtils]: 132: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,856 INFO L273 TraceCheckUtils]: 133: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,856 INFO L273 TraceCheckUtils]: 134: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,857 INFO L273 TraceCheckUtils]: 135: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,857 INFO L273 TraceCheckUtils]: 136: Hoare triple {12429#false} ~a~0 := ~a~0 + 1; {12429#false} is VALID [2018-11-14 18:40:40,857 INFO L273 TraceCheckUtils]: 137: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,857 INFO L273 TraceCheckUtils]: 138: Hoare triple {12429#false} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-14 18:40:40,857 INFO L273 TraceCheckUtils]: 139: Hoare triple {12429#false} havoc ~x~0;~x~0 := 0; {12429#false} is VALID [2018-11-14 18:40:40,857 INFO L273 TraceCheckUtils]: 140: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-14 18:40:40,858 INFO L273 TraceCheckUtils]: 141: Hoare triple {12429#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {12429#false} is VALID [2018-11-14 18:40:40,858 INFO L256 TraceCheckUtils]: 142: Hoare triple {12429#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {12429#false} is VALID [2018-11-14 18:40:40,858 INFO L273 TraceCheckUtils]: 143: Hoare triple {12429#false} ~cond := #in~cond; {12429#false} is VALID [2018-11-14 18:40:40,858 INFO L273 TraceCheckUtils]: 144: Hoare triple {12429#false} assume ~cond == 0; {12429#false} is VALID [2018-11-14 18:40:40,858 INFO L273 TraceCheckUtils]: 145: Hoare triple {12429#false} assume !false; {12429#false} is VALID [2018-11-14 18:40:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-14 18:40:40,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:40,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:40:40,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 146 [2018-11-14 18:40:40,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:40,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:40:41,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:41,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:40:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:40:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:40:41,014 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand 20 states. [2018-11-14 18:40:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:41,771 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2018-11-14 18:40:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:40:41,771 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 146 [2018-11-14 18:40:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:40:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 238 transitions. [2018-11-14 18:40:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:40:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 238 transitions. [2018-11-14 18:40:41,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 238 transitions. [2018-11-14 18:40:42,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:42,370 INFO L225 Difference]: With dead ends: 254 [2018-11-14 18:40:42,370 INFO L226 Difference]: Without dead ends: 169 [2018-11-14 18:40:42,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:40:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-14 18:40:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-11-14 18:40:42,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:42,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 165 states. [2018-11-14 18:40:42,448 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 165 states. [2018-11-14 18:40:42,448 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 165 states. [2018-11-14 18:40:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:42,451 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2018-11-14 18:40:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2018-11-14 18:40:42,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:42,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:42,452 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 169 states. [2018-11-14 18:40:42,452 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 169 states. [2018-11-14 18:40:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:42,456 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2018-11-14 18:40:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2018-11-14 18:40:42,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:42,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:42,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:42,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-14 18:40:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2018-11-14 18:40:42,460 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 146 [2018-11-14 18:40:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:42,460 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2018-11-14 18:40:42,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:40:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2018-11-14 18:40:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 18:40:42,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:42,461 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:42,461 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:42,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1405143251, now seen corresponding path program 17 times [2018-11-14 18:40:42,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:42,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:42,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:42,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:42,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {13754#true} call ULTIMATE.init(); {13754#true} is VALID [2018-11-14 18:40:42,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {13754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13754#true} is VALID [2018-11-14 18:40:42,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:40:42,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13754#true} {13754#true} #95#return; {13754#true} is VALID [2018-11-14 18:40:42,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {13754#true} call #t~ret8 := main(); {13754#true} is VALID [2018-11-14 18:40:42,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {13754#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {13756#(= main_~a~0 0)} is VALID [2018-11-14 18:40:42,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {13756#(= main_~a~0 0)} assume true; {13756#(= main_~a~0 0)} is VALID [2018-11-14 18:40:42,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {13756#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13756#(= main_~a~0 0)} is VALID [2018-11-14 18:40:42,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {13756#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13756#(= main_~a~0 0)} is VALID [2018-11-14 18:40:42,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {13756#(= main_~a~0 0)} ~a~0 := ~a~0 + 1; {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {13757#(<= main_~a~0 1)} assume true; {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {13757#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {13757#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {13757#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {13758#(<= main_~a~0 2)} assume true; {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {13758#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {13758#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {13758#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {13759#(<= main_~a~0 3)} assume true; {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {13759#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {13759#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {13759#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {13760#(<= main_~a~0 4)} assume true; {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {13760#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {13760#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {13760#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {13761#(<= main_~a~0 5)} assume true; {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,817 INFO L273 TraceCheckUtils]: 27: Hoare triple {13761#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,817 INFO L273 TraceCheckUtils]: 28: Hoare triple {13761#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {13761#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {13762#(<= main_~a~0 6)} assume true; {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {13762#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {13762#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {13762#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,821 INFO L273 TraceCheckUtils]: 34: Hoare triple {13763#(<= main_~a~0 7)} assume true; {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {13763#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {13763#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,823 INFO L273 TraceCheckUtils]: 37: Hoare triple {13763#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,823 INFO L273 TraceCheckUtils]: 38: Hoare triple {13764#(<= main_~a~0 8)} assume true; {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {13764#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {13764#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {13764#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {13765#(<= main_~a~0 9)} assume true; {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {13765#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {13765#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {13765#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {13766#(<= main_~a~0 10)} assume true; {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {13766#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {13766#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {13766#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:42,830 INFO L273 TraceCheckUtils]: 50: Hoare triple {13767#(<= main_~a~0 11)} assume true; {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:42,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {13767#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:42,831 INFO L273 TraceCheckUtils]: 52: Hoare triple {13767#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:42,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {13767#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:42,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {13768#(<= main_~a~0 12)} assume true; {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:42,833 INFO L273 TraceCheckUtils]: 55: Hoare triple {13768#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:42,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {13768#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:42,834 INFO L273 TraceCheckUtils]: 57: Hoare triple {13768#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:42,835 INFO L273 TraceCheckUtils]: 58: Hoare triple {13769#(<= main_~a~0 13)} assume true; {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:42,835 INFO L273 TraceCheckUtils]: 59: Hoare triple {13769#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:42,836 INFO L273 TraceCheckUtils]: 60: Hoare triple {13769#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:40:42,836 INFO L273 TraceCheckUtils]: 61: Hoare triple {13769#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:42,837 INFO L273 TraceCheckUtils]: 62: Hoare triple {13770#(<= main_~a~0 14)} assume true; {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:42,837 INFO L273 TraceCheckUtils]: 63: Hoare triple {13770#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:42,838 INFO L273 TraceCheckUtils]: 64: Hoare triple {13770#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:40:42,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {13770#(<= main_~a~0 14)} ~a~0 := ~a~0 + 1; {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:42,839 INFO L273 TraceCheckUtils]: 66: Hoare triple {13771#(<= main_~a~0 15)} assume true; {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:42,840 INFO L273 TraceCheckUtils]: 67: Hoare triple {13771#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:42,840 INFO L273 TraceCheckUtils]: 68: Hoare triple {13771#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:40:42,841 INFO L273 TraceCheckUtils]: 69: Hoare triple {13771#(<= main_~a~0 15)} ~a~0 := ~a~0 + 1; {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:42,841 INFO L273 TraceCheckUtils]: 70: Hoare triple {13772#(<= main_~a~0 16)} assume true; {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:42,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {13772#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:42,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {13772#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:40:42,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {13772#(<= main_~a~0 16)} ~a~0 := ~a~0 + 1; {13773#(<= main_~a~0 17)} is VALID [2018-11-14 18:40:42,844 INFO L273 TraceCheckUtils]: 74: Hoare triple {13773#(<= main_~a~0 17)} assume true; {13773#(<= main_~a~0 17)} is VALID [2018-11-14 18:40:42,844 INFO L273 TraceCheckUtils]: 75: Hoare triple {13773#(<= main_~a~0 17)} assume !(~a~0 < 100000); {13755#false} is VALID [2018-11-14 18:40:42,845 INFO L273 TraceCheckUtils]: 76: Hoare triple {13755#false} ~a~0 := 0; {13755#false} is VALID [2018-11-14 18:40:42,845 INFO L273 TraceCheckUtils]: 77: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,845 INFO L273 TraceCheckUtils]: 78: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,845 INFO L273 TraceCheckUtils]: 79: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,845 INFO L273 TraceCheckUtils]: 80: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,846 INFO L273 TraceCheckUtils]: 81: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,846 INFO L273 TraceCheckUtils]: 82: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,846 INFO L273 TraceCheckUtils]: 83: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,846 INFO L273 TraceCheckUtils]: 84: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,846 INFO L273 TraceCheckUtils]: 85: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,847 INFO L273 TraceCheckUtils]: 86: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,847 INFO L273 TraceCheckUtils]: 87: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,847 INFO L273 TraceCheckUtils]: 88: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,847 INFO L273 TraceCheckUtils]: 89: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,847 INFO L273 TraceCheckUtils]: 90: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,847 INFO L273 TraceCheckUtils]: 91: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 92: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 93: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 94: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 95: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 96: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 97: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 98: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 99: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,848 INFO L273 TraceCheckUtils]: 100: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 101: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 102: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 103: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 104: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 105: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 106: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 107: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 108: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,849 INFO L273 TraceCheckUtils]: 109: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 110: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 111: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 112: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 113: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 114: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 115: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 116: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 117: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,850 INFO L273 TraceCheckUtils]: 118: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 119: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 120: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 121: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 122: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 123: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 124: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 125: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 126: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,851 INFO L273 TraceCheckUtils]: 127: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 128: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 129: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 130: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 131: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 132: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 133: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 134: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 135: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,852 INFO L273 TraceCheckUtils]: 136: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 137: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 138: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 139: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 140: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 141: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 142: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 143: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 144: Hoare triple {13755#false} ~a~0 := ~a~0 + 1; {13755#false} is VALID [2018-11-14 18:40:42,853 INFO L273 TraceCheckUtils]: 145: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 146: Hoare triple {13755#false} assume !(~a~0 < 100000); {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 147: Hoare triple {13755#false} havoc ~x~0;~x~0 := 0; {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 148: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 149: Hoare triple {13755#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L256 TraceCheckUtils]: 150: Hoare triple {13755#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 151: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 152: Hoare triple {13755#false} assume ~cond == 0; {13755#false} is VALID [2018-11-14 18:40:42,854 INFO L273 TraceCheckUtils]: 153: Hoare triple {13755#false} assume !false; {13755#false} is VALID [2018-11-14 18:40:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-14 18:40:42,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:42,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:40:42,876 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:41:31,303 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 18:41:31,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:41:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:41:31,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:41:31,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {13754#true} call ULTIMATE.init(); {13754#true} is VALID [2018-11-14 18:41:31,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {13754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13754#true} is VALID [2018-11-14 18:41:31,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13754#true} {13754#true} #95#return; {13754#true} is VALID [2018-11-14 18:41:31,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {13754#true} call #t~ret8 := main(); {13754#true} is VALID [2018-11-14 18:41:31,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {13754#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {13754#true} is VALID [2018-11-14 18:41:31,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 56: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,617 INFO L273 TraceCheckUtils]: 61: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 62: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 63: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 64: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 65: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 71: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + ~b~0 * 4, 4);havoc #t~mem1;~b~0 := ~b~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {13754#true} ~a~0 := ~a~0 + 1; {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 74: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-14 18:41:31,619 INFO L273 TraceCheckUtils]: 75: Hoare triple {13754#true} assume !(~a~0 < 100000); {13754#true} is VALID [2018-11-14 18:41:31,620 INFO L273 TraceCheckUtils]: 76: Hoare triple {13754#true} ~a~0 := 0; {14005#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:31,620 INFO L273 TraceCheckUtils]: 77: Hoare triple {14005#(<= main_~a~0 0)} assume true; {14005#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:31,621 INFO L273 TraceCheckUtils]: 78: Hoare triple {14005#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {14005#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:31,621 INFO L273 TraceCheckUtils]: 79: Hoare triple {14005#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {14005#(<= main_~a~0 0)} is VALID [2018-11-14 18:41:31,622 INFO L273 TraceCheckUtils]: 80: Hoare triple {14005#(<= main_~a~0 0)} ~a~0 := ~a~0 + 1; {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:31,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {13757#(<= main_~a~0 1)} assume true; {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:31,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {13757#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:31,624 INFO L273 TraceCheckUtils]: 83: Hoare triple {13757#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13757#(<= main_~a~0 1)} is VALID [2018-11-14 18:41:31,625 INFO L273 TraceCheckUtils]: 84: Hoare triple {13757#(<= main_~a~0 1)} ~a~0 := ~a~0 + 1; {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:31,625 INFO L273 TraceCheckUtils]: 85: Hoare triple {13758#(<= main_~a~0 2)} assume true; {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:31,626 INFO L273 TraceCheckUtils]: 86: Hoare triple {13758#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:31,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {13758#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13758#(<= main_~a~0 2)} is VALID [2018-11-14 18:41:31,627 INFO L273 TraceCheckUtils]: 88: Hoare triple {13758#(<= main_~a~0 2)} ~a~0 := ~a~0 + 1; {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:31,628 INFO L273 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~a~0 3)} assume true; {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:31,629 INFO L273 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:31,629 INFO L273 TraceCheckUtils]: 91: Hoare triple {13759#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13759#(<= main_~a~0 3)} is VALID [2018-11-14 18:41:31,630 INFO L273 TraceCheckUtils]: 92: Hoare triple {13759#(<= main_~a~0 3)} ~a~0 := ~a~0 + 1; {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:31,631 INFO L273 TraceCheckUtils]: 93: Hoare triple {13760#(<= main_~a~0 4)} assume true; {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:31,631 INFO L273 TraceCheckUtils]: 94: Hoare triple {13760#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:31,632 INFO L273 TraceCheckUtils]: 95: Hoare triple {13760#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13760#(<= main_~a~0 4)} is VALID [2018-11-14 18:41:31,633 INFO L273 TraceCheckUtils]: 96: Hoare triple {13760#(<= main_~a~0 4)} ~a~0 := ~a~0 + 1; {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:31,633 INFO L273 TraceCheckUtils]: 97: Hoare triple {13761#(<= main_~a~0 5)} assume true; {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:31,634 INFO L273 TraceCheckUtils]: 98: Hoare triple {13761#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:31,635 INFO L273 TraceCheckUtils]: 99: Hoare triple {13761#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13761#(<= main_~a~0 5)} is VALID [2018-11-14 18:41:31,635 INFO L273 TraceCheckUtils]: 100: Hoare triple {13761#(<= main_~a~0 5)} ~a~0 := ~a~0 + 1; {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:31,636 INFO L273 TraceCheckUtils]: 101: Hoare triple {13762#(<= main_~a~0 6)} assume true; {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:31,637 INFO L273 TraceCheckUtils]: 102: Hoare triple {13762#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:31,637 INFO L273 TraceCheckUtils]: 103: Hoare triple {13762#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13762#(<= main_~a~0 6)} is VALID [2018-11-14 18:41:31,638 INFO L273 TraceCheckUtils]: 104: Hoare triple {13762#(<= main_~a~0 6)} ~a~0 := ~a~0 + 1; {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:31,639 INFO L273 TraceCheckUtils]: 105: Hoare triple {13763#(<= main_~a~0 7)} assume true; {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:31,639 INFO L273 TraceCheckUtils]: 106: Hoare triple {13763#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:31,640 INFO L273 TraceCheckUtils]: 107: Hoare triple {13763#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13763#(<= main_~a~0 7)} is VALID [2018-11-14 18:41:31,641 INFO L273 TraceCheckUtils]: 108: Hoare triple {13763#(<= main_~a~0 7)} ~a~0 := ~a~0 + 1; {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:31,641 INFO L273 TraceCheckUtils]: 109: Hoare triple {13764#(<= main_~a~0 8)} assume true; {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:31,642 INFO L273 TraceCheckUtils]: 110: Hoare triple {13764#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:31,643 INFO L273 TraceCheckUtils]: 111: Hoare triple {13764#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13764#(<= main_~a~0 8)} is VALID [2018-11-14 18:41:31,644 INFO L273 TraceCheckUtils]: 112: Hoare triple {13764#(<= main_~a~0 8)} ~a~0 := ~a~0 + 1; {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:41:31,644 INFO L273 TraceCheckUtils]: 113: Hoare triple {13765#(<= main_~a~0 9)} assume true; {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:41:31,645 INFO L273 TraceCheckUtils]: 114: Hoare triple {13765#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:41:31,645 INFO L273 TraceCheckUtils]: 115: Hoare triple {13765#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13765#(<= main_~a~0 9)} is VALID [2018-11-14 18:41:31,646 INFO L273 TraceCheckUtils]: 116: Hoare triple {13765#(<= main_~a~0 9)} ~a~0 := ~a~0 + 1; {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:41:31,647 INFO L273 TraceCheckUtils]: 117: Hoare triple {13766#(<= main_~a~0 10)} assume true; {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:41:31,647 INFO L273 TraceCheckUtils]: 118: Hoare triple {13766#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:41:31,648 INFO L273 TraceCheckUtils]: 119: Hoare triple {13766#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13766#(<= main_~a~0 10)} is VALID [2018-11-14 18:41:31,649 INFO L273 TraceCheckUtils]: 120: Hoare triple {13766#(<= main_~a~0 10)} ~a~0 := ~a~0 + 1; {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:41:31,650 INFO L273 TraceCheckUtils]: 121: Hoare triple {13767#(<= main_~a~0 11)} assume true; {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:41:31,650 INFO L273 TraceCheckUtils]: 122: Hoare triple {13767#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:41:31,651 INFO L273 TraceCheckUtils]: 123: Hoare triple {13767#(<= main_~a~0 11)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13767#(<= main_~a~0 11)} is VALID [2018-11-14 18:41:31,652 INFO L273 TraceCheckUtils]: 124: Hoare triple {13767#(<= main_~a~0 11)} ~a~0 := ~a~0 + 1; {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:41:31,652 INFO L273 TraceCheckUtils]: 125: Hoare triple {13768#(<= main_~a~0 12)} assume true; {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:41:31,653 INFO L273 TraceCheckUtils]: 126: Hoare triple {13768#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:41:31,654 INFO L273 TraceCheckUtils]: 127: Hoare triple {13768#(<= main_~a~0 12)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13768#(<= main_~a~0 12)} is VALID [2018-11-14 18:41:31,654 INFO L273 TraceCheckUtils]: 128: Hoare triple {13768#(<= main_~a~0 12)} ~a~0 := ~a~0 + 1; {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:41:31,655 INFO L273 TraceCheckUtils]: 129: Hoare triple {13769#(<= main_~a~0 13)} assume true; {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:41:31,656 INFO L273 TraceCheckUtils]: 130: Hoare triple {13769#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:41:31,656 INFO L273 TraceCheckUtils]: 131: Hoare triple {13769#(<= main_~a~0 13)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13769#(<= main_~a~0 13)} is VALID [2018-11-14 18:41:31,657 INFO L273 TraceCheckUtils]: 132: Hoare triple {13769#(<= main_~a~0 13)} ~a~0 := ~a~0 + 1; {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:41:31,658 INFO L273 TraceCheckUtils]: 133: Hoare triple {13770#(<= main_~a~0 14)} assume true; {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:41:31,658 INFO L273 TraceCheckUtils]: 134: Hoare triple {13770#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:41:31,659 INFO L273 TraceCheckUtils]: 135: Hoare triple {13770#(<= main_~a~0 14)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13770#(<= main_~a~0 14)} is VALID [2018-11-14 18:41:31,660 INFO L273 TraceCheckUtils]: 136: Hoare triple {13770#(<= main_~a~0 14)} ~a~0 := ~a~0 + 1; {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:41:31,660 INFO L273 TraceCheckUtils]: 137: Hoare triple {13771#(<= main_~a~0 15)} assume true; {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:41:31,661 INFO L273 TraceCheckUtils]: 138: Hoare triple {13771#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:41:31,662 INFO L273 TraceCheckUtils]: 139: Hoare triple {13771#(<= main_~a~0 15)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13771#(<= main_~a~0 15)} is VALID [2018-11-14 18:41:31,663 INFO L273 TraceCheckUtils]: 140: Hoare triple {13771#(<= main_~a~0 15)} ~a~0 := ~a~0 + 1; {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:41:31,663 INFO L273 TraceCheckUtils]: 141: Hoare triple {13772#(<= main_~a~0 16)} assume true; {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:41:31,664 INFO L273 TraceCheckUtils]: 142: Hoare triple {13772#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4); {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:41:31,664 INFO L273 TraceCheckUtils]: 143: Hoare triple {13772#(<= main_~a~0 16)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + ~a~0 * 4, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + ~c~0 * 4, 4);havoc #t~mem3;~c~0 := ~c~0 + 1; {13772#(<= main_~a~0 16)} is VALID [2018-11-14 18:41:31,665 INFO L273 TraceCheckUtils]: 144: Hoare triple {13772#(<= main_~a~0 16)} ~a~0 := ~a~0 + 1; {13773#(<= main_~a~0 17)} is VALID [2018-11-14 18:41:31,666 INFO L273 TraceCheckUtils]: 145: Hoare triple {13773#(<= main_~a~0 17)} assume true; {13773#(<= main_~a~0 17)} is VALID [2018-11-14 18:41:31,667 INFO L273 TraceCheckUtils]: 146: Hoare triple {13773#(<= main_~a~0 17)} assume !(~a~0 < 100000); {13755#false} is VALID [2018-11-14 18:41:31,667 INFO L273 TraceCheckUtils]: 147: Hoare triple {13755#false} havoc ~x~0;~x~0 := 0; {13755#false} is VALID [2018-11-14 18:41:31,667 INFO L273 TraceCheckUtils]: 148: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-14 18:41:31,668 INFO L273 TraceCheckUtils]: 149: Hoare triple {13755#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + ~x~0 * 4, 4); {13755#false} is VALID [2018-11-14 18:41:31,668 INFO L256 TraceCheckUtils]: 150: Hoare triple {13755#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {13755#false} is VALID [2018-11-14 18:41:31,668 INFO L273 TraceCheckUtils]: 151: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2018-11-14 18:41:31,668 INFO L273 TraceCheckUtils]: 152: Hoare triple {13755#false} assume ~cond == 0; {13755#false} is VALID [2018-11-14 18:41:31,669 INFO L273 TraceCheckUtils]: 153: Hoare triple {13755#false} assume !false; {13755#false} is VALID [2018-11-14 18:41:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-14 18:41:31,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:41:31,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 18:41:31,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2018-11-14 18:41:31,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:41:31,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:41:31,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:31,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:41:31,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:41:31,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:41:31,966 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand 21 states. [2018-11-14 18:41:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:33,665 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2018-11-14 18:41:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:41:33,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2018-11-14 18:41:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:41:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:41:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 248 transitions. [2018-11-14 18:41:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:41:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 248 transitions. [2018-11-14 18:41:33,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 248 transitions. [2018-11-14 18:41:34,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:41:34,040 INFO L225 Difference]: With dead ends: 266 [2018-11-14 18:41:34,041 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 18:41:34,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:41:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 18:41:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-11-14 18:41:34,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:41:34,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 173 states. [2018-11-14 18:41:34,076 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 173 states. [2018-11-14 18:41:34,076 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 173 states. [2018-11-14 18:41:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,079 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2018-11-14 18:41:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2018-11-14 18:41:34,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:34,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:34,080 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 177 states. [2018-11-14 18:41:34,080 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 177 states. [2018-11-14 18:41:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:41:34,083 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2018-11-14 18:41:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2018-11-14 18:41:34,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:41:34,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:41:34,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:41:34,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:41:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 18:41:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2018-11-14 18:41:34,088 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 154 [2018-11-14 18:41:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:41:34,088 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2018-11-14 18:41:34,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:41:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2018-11-14 18:41:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-14 18:41:34,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:41:34,089 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:41:34,090 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:41:34,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:41:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash -276020781, now seen corresponding path program 18 times [2018-11-14 18:41:34,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:41:34,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:41:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:34,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:41:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:41:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat