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.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:53:19,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:53:19,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:53:19,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:53:19,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:53:19,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:53:19,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:53:19,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:53:19,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:53:19,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:53:19,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:53:19,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:53:19,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:53:19,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:53:19,115 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:53:19,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:53:19,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:53:19,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:53:19,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:53:19,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:53:19,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:53:19,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:53:19,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:53:19,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:53:19,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:53:19,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:53:19,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:53:19,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:53:19,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:53:19,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:53:19,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:53:19,134 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:53:19,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:53:19,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:53:19,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:53:19,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:53:19,137 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:53:19,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:53:19,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:53:19,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:53:19,168 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:53:19,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:53:19,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:53:19,169 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:53:19,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:53:19,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:53:19,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:53:19,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:53:19,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:53:19,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:53:19,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:53:19,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:53:19,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:53:19,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:53:19,171 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:53:19,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:53:19,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:53:19,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:53:19,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:53:19,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:53:19,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:53:19,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:53:19,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:53:19,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:53:19,173 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:53:19,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:53:19,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:53:19,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:53:19,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:53:19,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:53:19,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:53:19,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:53:19,255 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:53:19,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i [2018-11-18 22:53:19,318 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391002987/5070f536e019470f81ea45d61fa00e29/FLAGb2917356e [2018-11-18 22:53:19,739 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:53:19,740 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i [2018-11-18 22:53:19,746 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391002987/5070f536e019470f81ea45d61fa00e29/FLAGb2917356e [2018-11-18 22:53:20,135 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391002987/5070f536e019470f81ea45d61fa00e29 [2018-11-18 22:53:20,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:53:20,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:53:20,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:53:20,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:53:20,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:53:20,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e7872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20, skipping insertion in model container [2018-11-18 22:53:20,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:53:20,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:53:20,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:53:20,473 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:53:20,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:53:20,530 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:53:20,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20 WrapperNode [2018-11-18 22:53:20,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:53:20,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:53:20,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:53:20,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:53:20,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (1/1) ... [2018-11-18 22:53:20,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:53:20,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:53:20,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:53:20,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:53:20,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (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-18 22:53:20,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:53:20,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:53:20,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:53:20,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:53:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:53:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:53:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:53:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:53:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:53:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:53:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:53:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:53:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:53:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:53:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:53:21,409 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:53:21,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:21 BoogieIcfgContainer [2018-11-18 22:53:21,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:53:21,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:53:21,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:53:21,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:53:21,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:53:20" (1/3) ... [2018-11-18 22:53:21,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618cdb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:21, skipping insertion in model container [2018-11-18 22:53:21,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:53:20" (2/3) ... [2018-11-18 22:53:21,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618cdb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:53:21, skipping insertion in model container [2018-11-18 22:53:21,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:53:21" (3/3) ... [2018-11-18 22:53:21,419 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum_true-unreach-call_ground.i [2018-11-18 22:53:21,430 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:53:21,439 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:53:21,459 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:53:21,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:53:21,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:53:21,497 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:53:21,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:53:21,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:53:21,498 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:53:21,498 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:53:21,498 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:53:21,499 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:53:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 22:53:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:53:21,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:21,530 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-18 22:53:21,533 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:21,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash -422982541, now seen corresponding path program 1 times [2018-11-18 22:53:21,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:21,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:21,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:21,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-18 22:53:21,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-18 22:53:21,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-18 22:53:21,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2018-11-18 22:53:21,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2018-11-18 22:53:21,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {36#true} is VALID [2018-11-18 22:53:21,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-18 22:53:21,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-18 22:53:21,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-18 22:53:21,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-18 22:53:21,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-18 22:53:21,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-18 22:53:21,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-18 22:53:21,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {37#false} is VALID [2018-11-18 22:53:21,817 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {37#false} is VALID [2018-11-18 22:53:21,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-18 22:53:21,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-18 22:53:21,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-18 22:53:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:53:21,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:21,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:53:21,831 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 22:53:21,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:21,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:53:22,009 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-18 22:53:22,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:53:22,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:53:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:53:22,024 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-18 22:53:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:22,223 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-18 22:53:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:53:22,224 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 22:53:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-18 22:53:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:53:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-18 22:53:22,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-18 22:53:22,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:22,743 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:53:22,743 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 22:53:22,749 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-18 22:53:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 22:53:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 22:53:22,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:22,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-18 22:53:22,912 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 22:53:22,912 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 22:53:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:22,921 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-18 22:53:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 22:53:22,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:22,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:22,922 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 22:53:22,923 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 22:53:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:22,928 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-18 22:53:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 22:53:22,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:22,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:22,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:22,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:53:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-18 22:53:22,935 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2018-11-18 22:53:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:22,936 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 22:53:22,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:53:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 22:53:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:53:22,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:22,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:22,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:22,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1279953697, now seen corresponding path program 1 times [2018-11-18 22:53:22,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:22,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:22,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:23,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-18 22:53:23,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {207#true} is VALID [2018-11-18 22:53:23,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-18 22:53:23,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {207#true} {207#true} #80#return; {207#true} is VALID [2018-11-18 22:53:23,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {207#true} call #t~ret7 := main(); {207#true} is VALID [2018-11-18 22:53:23,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {207#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {209#(= main_~i~0 0)} is VALID [2018-11-18 22:53:23,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(= main_~i~0 0)} assume true; {209#(= main_~i~0 0)} is VALID [2018-11-18 22:53:23,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#(= main_~i~0 0)} assume !(~i~0 < 100000); {208#false} is VALID [2018-11-18 22:53:23,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {208#false} ~i~0 := 0; {208#false} is VALID [2018-11-18 22:53:23,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {208#false} assume true; {208#false} is VALID [2018-11-18 22:53:23,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {208#false} assume !(~i~0 < 100000); {208#false} is VALID [2018-11-18 22:53:23,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#false} ~i~0 := 0; {208#false} is VALID [2018-11-18 22:53:23,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume true; {208#false} is VALID [2018-11-18 22:53:23,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#false} assume !(~i~0 < 100000); {208#false} is VALID [2018-11-18 22:53:23,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {208#false} havoc ~x~0;~x~0 := 0; {208#false} is VALID [2018-11-18 22:53:23,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {208#false} assume true; {208#false} is VALID [2018-11-18 22:53:23,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {208#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {208#false} is VALID [2018-11-18 22:53:23,117 INFO L256 TraceCheckUtils]: 17: Hoare triple {208#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {208#false} is VALID [2018-11-18 22:53:23,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2018-11-18 22:53:23,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2018-11-18 22:53:23,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-18 22:53:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:53:23,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:53:23,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:53:23,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:53:23,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:23,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:53:23,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:23,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:53:23,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:53:23,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:53:23,211 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-18 22:53:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:23,685 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-18 22:53:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:53:23,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:53:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-18 22:53:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:53:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-18 22:53:23,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-18 22:53:23,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:23,896 INFO L225 Difference]: With dead ends: 56 [2018-11-18 22:53:23,897 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 22:53:23,898 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-18 22:53:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 22:53:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 22:53:23,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:23,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-18 22:53:23,924 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-18 22:53:23,924 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-18 22:53:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:23,927 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-18 22:53:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-18 22:53:23,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:23,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:23,929 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-18 22:53:23,929 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-18 22:53:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:23,932 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-18 22:53:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-18 22:53:23,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:23,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:23,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:23,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:53:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-18 22:53:23,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2018-11-18 22:53:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:23,937 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-18 22:53:23,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:53:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 22:53:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:53:23,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:23,939 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:23,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:23,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 417422168, now seen corresponding path program 1 times [2018-11-18 22:53:23,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:23,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:24,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-18 22:53:24,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {405#true} is VALID [2018-11-18 22:53:24,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-18 22:53:24,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #80#return; {405#true} is VALID [2018-11-18 22:53:24,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret7 := main(); {405#true} is VALID [2018-11-18 22:53:24,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {407#(= main_~i~0 0)} is VALID [2018-11-18 22:53:24,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {407#(= main_~i~0 0)} assume true; {407#(= main_~i~0 0)} is VALID [2018-11-18 22:53:24,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {407#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {408#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 1)} assume true; {408#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 1)} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-18 22:53:24,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-18 22:53:24,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {406#false} is VALID [2018-11-18 22:53:24,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {406#false} is VALID [2018-11-18 22:53:24,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-18 22:53:24,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-18 22:53:24,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {406#false} is VALID [2018-11-18 22:53:24,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {406#false} is VALID [2018-11-18 22:53:24,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-18 22:53:24,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {406#false} havoc ~x~0;~x~0 := 0; {406#false} is VALID [2018-11-18 22:53:24,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {406#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {406#false} is VALID [2018-11-18 22:53:24,084 INFO L256 TraceCheckUtils]: 25: Hoare triple {406#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {406#false} is VALID [2018-11-18 22:53:24,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {406#false} ~cond := #in~cond; {406#false} is VALID [2018-11-18 22:53:24,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {406#false} assume 0 == ~cond; {406#false} is VALID [2018-11-18 22:53:24,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-18 22:53:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:53:24,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:24,088 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-18 22:53:24,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:24,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:24,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-18 22:53:24,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {405#true} is VALID [2018-11-18 22:53:24,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-18 22:53:24,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #80#return; {405#true} is VALID [2018-11-18 22:53:24,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret7 := main(); {405#true} is VALID [2018-11-18 22:53:24,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {427#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:24,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {427#(<= main_~i~0 0)} assume true; {427#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:24,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {427#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {408#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 1)} assume true; {408#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:24,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 1)} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-18 22:53:24,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-18 22:53:24,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {406#false} is VALID [2018-11-18 22:53:24,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {406#false} is VALID [2018-11-18 22:53:24,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-18 22:53:24,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-18 22:53:24,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {406#false} is VALID [2018-11-18 22:53:24,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {406#false} is VALID [2018-11-18 22:53:24,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-18 22:53:24,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {406#false} havoc ~x~0;~x~0 := 0; {406#false} is VALID [2018-11-18 22:53:24,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-18 22:53:24,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {406#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {406#false} is VALID [2018-11-18 22:53:24,557 INFO L256 TraceCheckUtils]: 25: Hoare triple {406#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {406#false} is VALID [2018-11-18 22:53:24,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {406#false} ~cond := #in~cond; {406#false} is VALID [2018-11-18 22:53:24,558 INFO L273 TraceCheckUtils]: 27: Hoare triple {406#false} assume 0 == ~cond; {406#false} is VALID [2018-11-18 22:53:24,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-18 22:53:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 22:53:24,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:24,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:53:24,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-18 22:53:24,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:24,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:53:24,823 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-18 22:53:24,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:53:24,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:53:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:53:24,825 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-11-18 22:53:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:25,325 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-18 22:53:25,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:53:25,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-18 22:53:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 22:53:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:53:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 22:53:25,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-18 22:53:25,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:25,491 INFO L225 Difference]: With dead ends: 68 [2018-11-18 22:53:25,491 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:53:25,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-18 22:53:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:53:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 22:53:25,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:25,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-18 22:53:25,525 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-18 22:53:25,525 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-18 22:53:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:25,528 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-18 22:53:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-18 22:53:25,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:25,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:25,534 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-18 22:53:25,534 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-18 22:53:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:25,539 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-18 22:53:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-18 22:53:25,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:25,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:25,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:25,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:53:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-18 22:53:25,547 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2018-11-18 22:53:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:25,547 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-18 22:53:25,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:53:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-18 22:53:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 22:53:25,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:25,549 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:25,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:25,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash 65711093, now seen corresponding path program 2 times [2018-11-18 22:53:25,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:25,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:25,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2018-11-18 22:53:25,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {733#true} is VALID [2018-11-18 22:53:25,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2018-11-18 22:53:25,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #80#return; {733#true} is VALID [2018-11-18 22:53:25,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2018-11-18 22:53:25,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {735#(= main_~i~0 0)} is VALID [2018-11-18 22:53:25,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {735#(= main_~i~0 0)} assume true; {735#(= main_~i~0 0)} is VALID [2018-11-18 22:53:25,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {735#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {736#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:25,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#(<= main_~i~0 1)} assume true; {736#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:25,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {737#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:25,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {737#(<= main_~i~0 2)} assume true; {737#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:25,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {737#(<= main_~i~0 2)} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-18 22:53:25,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-18 22:53:25,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {734#false} is VALID [2018-11-18 22:53:25,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {734#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#false} is VALID [2018-11-18 22:53:25,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {734#false} is VALID [2018-11-18 22:53:25,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {734#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#false} is VALID [2018-11-18 22:53:25,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-18 22:53:25,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-18 22:53:25,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {734#false} is VALID [2018-11-18 22:53:25,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {734#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {734#false} is VALID [2018-11-18 22:53:25,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {734#false} is VALID [2018-11-18 22:53:25,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {734#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {734#false} is VALID [2018-11-18 22:53:25,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-18 22:53:25,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {734#false} havoc ~x~0;~x~0 := 0; {734#false} is VALID [2018-11-18 22:53:25,775 INFO L273 TraceCheckUtils]: 31: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:25,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {734#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {734#false} is VALID [2018-11-18 22:53:25,775 INFO L256 TraceCheckUtils]: 33: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {734#false} is VALID [2018-11-18 22:53:25,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2018-11-18 22:53:25,776 INFO L273 TraceCheckUtils]: 35: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2018-11-18 22:53:25,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {734#false} assume !false; {734#false} is VALID [2018-11-18 22:53:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 22:53:25,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:25,780 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-18 22:53:25,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:25,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:25,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:25,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:25,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2018-11-18 22:53:25,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {733#true} is VALID [2018-11-18 22:53:25,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2018-11-18 22:53:25,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #80#return; {733#true} is VALID [2018-11-18 22:53:25,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2018-11-18 22:53:25,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {756#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:25,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {756#(<= main_~i~0 0)} assume true; {756#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:25,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {756#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {736#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:25,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#(<= main_~i~0 1)} assume true; {736#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:25,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {737#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {737#(<= main_~i~0 2)} assume true; {737#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {737#(<= main_~i~0 2)} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-18 22:53:26,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-18 22:53:26,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {734#false} is VALID [2018-11-18 22:53:26,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {734#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#false} is VALID [2018-11-18 22:53:26,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {734#false} is VALID [2018-11-18 22:53:26,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {734#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#false} is VALID [2018-11-18 22:53:26,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,004 INFO L273 TraceCheckUtils]: 20: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-18 22:53:26,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-18 22:53:26,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {734#false} is VALID [2018-11-18 22:53:26,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {734#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {734#false} is VALID [2018-11-18 22:53:26,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,005 INFO L273 TraceCheckUtils]: 26: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {734#false} is VALID [2018-11-18 22:53:26,006 INFO L273 TraceCheckUtils]: 27: Hoare triple {734#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {734#false} is VALID [2018-11-18 22:53:26,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-18 22:53:26,006 INFO L273 TraceCheckUtils]: 30: Hoare triple {734#false} havoc ~x~0;~x~0 := 0; {734#false} is VALID [2018-11-18 22:53:26,006 INFO L273 TraceCheckUtils]: 31: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-18 22:53:26,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {734#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {734#false} is VALID [2018-11-18 22:53:26,007 INFO L256 TraceCheckUtils]: 33: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {734#false} is VALID [2018-11-18 22:53:26,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2018-11-18 22:53:26,007 INFO L273 TraceCheckUtils]: 35: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2018-11-18 22:53:26,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {734#false} assume !false; {734#false} is VALID [2018-11-18 22:53:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 22:53:26,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:26,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:53:26,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-18 22:53:26,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:26,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:53:26,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:26,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:53:26,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:53:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:53:26,071 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2018-11-18 22:53:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:26,345 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-18 22:53:26,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:53:26,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-18 22:53:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-18 22:53:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:53:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-18 22:53:26,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-18 22:53:26,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:26,467 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:53:26,468 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 22:53:26,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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-18 22:53:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 22:53:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-18 22:53:26,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:26,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-18 22:53:26,511 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-18 22:53:26,511 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-18 22:53:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:26,514 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-18 22:53:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-18 22:53:26,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:26,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:26,515 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-18 22:53:26,515 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-18 22:53:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:26,518 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-18 22:53:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-18 22:53:26,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:26,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:26,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:26,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:53:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-18 22:53:26,524 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 37 [2018-11-18 22:53:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:26,524 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-18 22:53:26,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:53:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-18 22:53:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 22:53:26,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:26,526 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:26,527 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:26,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 645050220, now seen corresponding path program 3 times [2018-11-18 22:53:26,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:26,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:26,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {1132#true} call ULTIMATE.init(); {1132#true} is VALID [2018-11-18 22:53:26,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {1132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1132#true} is VALID [2018-11-18 22:53:26,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-18 22:53:26,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1132#true} {1132#true} #80#return; {1132#true} is VALID [2018-11-18 22:53:26,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {1132#true} call #t~ret7 := main(); {1132#true} is VALID [2018-11-18 22:53:26,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {1132#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1134#(= main_~i~0 0)} is VALID [2018-11-18 22:53:26,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {1134#(= main_~i~0 0)} assume true; {1134#(= main_~i~0 0)} is VALID [2018-11-18 22:53:26,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {1134#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1135#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:26,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {1135#(<= main_~i~0 1)} assume true; {1135#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:26,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {1135#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1136#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {1136#(<= main_~i~0 2)} assume true; {1136#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {1136#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1137#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:26,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {1137#(<= main_~i~0 3)} assume true; {1137#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:26,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {1137#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-18 22:53:26,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {1133#false} ~i~0 := 0; {1133#false} is VALID [2018-11-18 22:53:26,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1133#false} is VALID [2018-11-18 22:53:26,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {1133#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1133#false} is VALID [2018-11-18 22:53:26,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1133#false} is VALID [2018-11-18 22:53:26,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {1133#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1133#false} is VALID [2018-11-18 22:53:26,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1133#false} is VALID [2018-11-18 22:53:26,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {1133#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1133#false} is VALID [2018-11-18 22:53:26,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {1133#false} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-18 22:53:26,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {1133#false} ~i~0 := 0; {1133#false} is VALID [2018-11-18 22:53:26,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1133#false} is VALID [2018-11-18 22:53:26,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {1133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1133#false} is VALID [2018-11-18 22:53:26,684 INFO L273 TraceCheckUtils]: 30: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1133#false} is VALID [2018-11-18 22:53:26,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {1133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1133#false} is VALID [2018-11-18 22:53:26,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1133#false} is VALID [2018-11-18 22:53:26,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1133#false} is VALID [2018-11-18 22:53:26,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {1133#false} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-18 22:53:26,686 INFO L273 TraceCheckUtils]: 38: Hoare triple {1133#false} havoc ~x~0;~x~0 := 0; {1133#false} is VALID [2018-11-18 22:53:26,686 INFO L273 TraceCheckUtils]: 39: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {1133#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1133#false} is VALID [2018-11-18 22:53:26,687 INFO L256 TraceCheckUtils]: 41: Hoare triple {1133#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1133#false} is VALID [2018-11-18 22:53:26,687 INFO L273 TraceCheckUtils]: 42: Hoare triple {1133#false} ~cond := #in~cond; {1133#false} is VALID [2018-11-18 22:53:26,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {1133#false} assume 0 == ~cond; {1133#false} is VALID [2018-11-18 22:53:26,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {1133#false} assume !false; {1133#false} is VALID [2018-11-18 22:53:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 22:53:26,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:26,692 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-18 22:53:26,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:26,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:53:26,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:26,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:26,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {1132#true} call ULTIMATE.init(); {1132#true} is VALID [2018-11-18 22:53:26,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {1132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1132#true} is VALID [2018-11-18 22:53:26,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-18 22:53:26,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1132#true} {1132#true} #80#return; {1132#true} is VALID [2018-11-18 22:53:26,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {1132#true} call #t~ret7 := main(); {1132#true} is VALID [2018-11-18 22:53:26,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {1132#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1132#true} is VALID [2018-11-18 22:53:26,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-18 22:53:26,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {1132#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1132#true} is VALID [2018-11-18 22:53:26,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-18 22:53:26,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {1132#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1132#true} is VALID [2018-11-18 22:53:26,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-18 22:53:26,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {1132#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1132#true} is VALID [2018-11-18 22:53:26,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-18 22:53:26,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {1132#true} assume !(~i~0 < 100000); {1132#true} is VALID [2018-11-18 22:53:26,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {1132#true} ~i~0 := 0; {1183#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:26,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {1183#(<= main_~i~0 0)} assume true; {1183#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:26,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {1183#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1183#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:26,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {1183#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1135#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:26,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {1135#(<= main_~i~0 1)} assume true; {1135#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:26,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {1135#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1135#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:26,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {1135#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1136#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {1136#(<= main_~i~0 2)} assume true; {1136#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {1136#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1136#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:26,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {1136#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1137#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:26,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {1137#(<= main_~i~0 3)} assume true; {1137#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:26,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {1137#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-18 22:53:26,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {1133#false} ~i~0 := 0; {1133#false} is VALID [2018-11-18 22:53:26,933 INFO L273 TraceCheckUtils]: 27: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1133#false} is VALID [2018-11-18 22:53:26,934 INFO L273 TraceCheckUtils]: 29: Hoare triple {1133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1133#false} is VALID [2018-11-18 22:53:26,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1133#false} is VALID [2018-11-18 22:53:26,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {1133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1133#false} is VALID [2018-11-18 22:53:26,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1133#false} is VALID [2018-11-18 22:53:26,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1133#false} is VALID [2018-11-18 22:53:26,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {1133#false} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-18 22:53:26,938 INFO L273 TraceCheckUtils]: 38: Hoare triple {1133#false} havoc ~x~0;~x~0 := 0; {1133#false} is VALID [2018-11-18 22:53:26,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-18 22:53:26,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {1133#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1133#false} is VALID [2018-11-18 22:53:26,939 INFO L256 TraceCheckUtils]: 41: Hoare triple {1133#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1133#false} is VALID [2018-11-18 22:53:26,939 INFO L273 TraceCheckUtils]: 42: Hoare triple {1133#false} ~cond := #in~cond; {1133#false} is VALID [2018-11-18 22:53:26,939 INFO L273 TraceCheckUtils]: 43: Hoare triple {1133#false} assume 0 == ~cond; {1133#false} is VALID [2018-11-18 22:53:26,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {1133#false} assume !false; {1133#false} is VALID [2018-11-18 22:53:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 22:53:26,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:53:26,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-18 22:53:26,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:26,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:53:27,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:27,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:53:27,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:53:27,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:53:27,042 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-11-18 22:53:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:27,337 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-18 22:53:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:53:27,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-18 22:53:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-18 22:53:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:53:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-18 22:53:27,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2018-11-18 22:53:27,453 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-18 22:53:27,456 INFO L225 Difference]: With dead ends: 96 [2018-11-18 22:53:27,456 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 22:53:27,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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-18 22:53:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 22:53:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 22:53:27,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:27,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-18 22:53:27,524 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-18 22:53:27,524 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-18 22:53:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:27,527 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-18 22:53:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-18 22:53:27,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:27,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:27,528 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-18 22:53:27,529 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-18 22:53:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:27,531 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-18 22:53:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-18 22:53:27,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:27,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:27,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:27,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 22:53:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-18 22:53:27,535 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2018-11-18 22:53:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:27,536 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-18 22:53:27,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:53:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-18 22:53:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 22:53:27,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:27,538 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:27,538 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:27,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1058860745, now seen corresponding path program 4 times [2018-11-18 22:53:27,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:27,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:27,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {1602#true} call ULTIMATE.init(); {1602#true} is VALID [2018-11-18 22:53:27,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {1602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1602#true} is VALID [2018-11-18 22:53:27,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:27,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1602#true} {1602#true} #80#return; {1602#true} is VALID [2018-11-18 22:53:27,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {1602#true} call #t~ret7 := main(); {1602#true} is VALID [2018-11-18 22:53:27,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {1602#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1604#(= main_~i~0 0)} is VALID [2018-11-18 22:53:27,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {1604#(= main_~i~0 0)} assume true; {1604#(= main_~i~0 0)} is VALID [2018-11-18 22:53:27,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {1604#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1605#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:27,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {1605#(<= main_~i~0 1)} assume true; {1605#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:27,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {1605#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1606#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:27,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {1606#(<= main_~i~0 2)} assume true; {1606#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:27,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {1606#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1607#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:27,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {1607#(<= main_~i~0 3)} assume true; {1607#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:27,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {1607#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1608#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:27,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {1608#(<= main_~i~0 4)} assume true; {1608#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:27,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {1608#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-18 22:53:27,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {1603#false} ~i~0 := 0; {1603#false} is VALID [2018-11-18 22:53:27,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1603#false} is VALID [2018-11-18 22:53:27,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {1603#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1603#false} is VALID [2018-11-18 22:53:27,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1603#false} is VALID [2018-11-18 22:53:27,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {1603#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1603#false} is VALID [2018-11-18 22:53:27,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1603#false} is VALID [2018-11-18 22:53:27,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {1603#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1603#false} is VALID [2018-11-18 22:53:27,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1603#false} is VALID [2018-11-18 22:53:27,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {1603#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1603#false} is VALID [2018-11-18 22:53:27,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {1603#false} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-18 22:53:27,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {1603#false} ~i~0 := 0; {1603#false} is VALID [2018-11-18 22:53:27,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:27,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:27,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:27,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:27,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:27,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:27,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:27,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:27,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {1603#false} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-18 22:53:27,738 INFO L273 TraceCheckUtils]: 46: Hoare triple {1603#false} havoc ~x~0;~x~0 := 0; {1603#false} is VALID [2018-11-18 22:53:27,738 INFO L273 TraceCheckUtils]: 47: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:27,738 INFO L273 TraceCheckUtils]: 48: Hoare triple {1603#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1603#false} is VALID [2018-11-18 22:53:27,739 INFO L256 TraceCheckUtils]: 49: Hoare triple {1603#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1603#false} is VALID [2018-11-18 22:53:27,739 INFO L273 TraceCheckUtils]: 50: Hoare triple {1603#false} ~cond := #in~cond; {1603#false} is VALID [2018-11-18 22:53:27,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {1603#false} assume 0 == ~cond; {1603#false} is VALID [2018-11-18 22:53:27,739 INFO L273 TraceCheckUtils]: 52: Hoare triple {1603#false} assume !false; {1603#false} is VALID [2018-11-18 22:53:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 22:53:27,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:27,743 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-18 22:53:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:53:27,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:53:27,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:27,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:28,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {1602#true} call ULTIMATE.init(); {1602#true} is VALID [2018-11-18 22:53:28,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {1602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1602#true} is VALID [2018-11-18 22:53:28,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:28,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1602#true} {1602#true} #80#return; {1602#true} is VALID [2018-11-18 22:53:28,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {1602#true} call #t~ret7 := main(); {1602#true} is VALID [2018-11-18 22:53:28,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {1602#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {1602#true} is VALID [2018-11-18 22:53:28,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:28,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1602#true} is VALID [2018-11-18 22:53:28,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:28,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1602#true} is VALID [2018-11-18 22:53:28,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:28,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1602#true} is VALID [2018-11-18 22:53:28,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:28,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1602#true} is VALID [2018-11-18 22:53:28,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-18 22:53:28,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {1602#true} assume !(~i~0 < 100000); {1602#true} is VALID [2018-11-18 22:53:28,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {1602#true} ~i~0 := 0; {1660#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:28,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {1660#(<= main_~i~0 0)} assume true; {1660#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:28,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {1660#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1660#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:28,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {1660#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1605#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:28,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {1605#(<= main_~i~0 1)} assume true; {1605#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:28,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1605#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:28,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1606#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:28,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {1606#(<= main_~i~0 2)} assume true; {1606#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:28,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {1606#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1606#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:28,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {1606#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1607#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:28,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {1607#(<= main_~i~0 3)} assume true; {1607#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:28,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {1607#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {1607#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:28,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {1607#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1608#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:28,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {1608#(<= main_~i~0 4)} assume true; {1608#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:28,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {1608#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-18 22:53:28,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {1603#false} ~i~0 := 0; {1603#false} is VALID [2018-11-18 22:53:28,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:28,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:28,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:28,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:28,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:28,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:28,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:28,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:28,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:28,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:28,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1603#false} is VALID [2018-11-18 22:53:28,147 INFO L273 TraceCheckUtils]: 43: Hoare triple {1603#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1603#false} is VALID [2018-11-18 22:53:28,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:28,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {1603#false} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-18 22:53:28,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {1603#false} havoc ~x~0;~x~0 := 0; {1603#false} is VALID [2018-11-18 22:53:28,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-18 22:53:28,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {1603#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1603#false} is VALID [2018-11-18 22:53:28,148 INFO L256 TraceCheckUtils]: 49: Hoare triple {1603#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {1603#false} is VALID [2018-11-18 22:53:28,149 INFO L273 TraceCheckUtils]: 50: Hoare triple {1603#false} ~cond := #in~cond; {1603#false} is VALID [2018-11-18 22:53:28,149 INFO L273 TraceCheckUtils]: 51: Hoare triple {1603#false} assume 0 == ~cond; {1603#false} is VALID [2018-11-18 22:53:28,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {1603#false} assume !false; {1603#false} is VALID [2018-11-18 22:53:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 22:53:28,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:28,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:53:28,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-18 22:53:28,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:28,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:53:28,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:28,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:53:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:53:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:53:28,266 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-11-18 22:53:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:28,725 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-18 22:53:28,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:53:28,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-18 22:53:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:53:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-18 22:53:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:53:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-18 22:53:28,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2018-11-18 22:53:28,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:28,912 INFO L225 Difference]: With dead ends: 110 [2018-11-18 22:53:28,912 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 22:53:28,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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-18 22:53:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 22:53:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-18 22:53:28,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:28,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-18 22:53:28,949 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-18 22:53:28,949 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-18 22:53:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:28,952 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-18 22:53:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-18 22:53:28,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:28,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:28,953 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-18 22:53:28,954 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-18 22:53:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:28,956 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-18 22:53:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-18 22:53:28,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:28,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:28,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:28,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 22:53:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-18 22:53:28,960 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 53 [2018-11-18 22:53:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:28,961 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-18 22:53:28,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:53:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-18 22:53:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 22:53:28,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:28,962 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:28,962 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:28,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1111296640, now seen corresponding path program 5 times [2018-11-18 22:53:28,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:28,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:28,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:29,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {2143#true} call ULTIMATE.init(); {2143#true} is VALID [2018-11-18 22:53:29,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {2143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2143#true} is VALID [2018-11-18 22:53:29,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:29,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2143#true} {2143#true} #80#return; {2143#true} is VALID [2018-11-18 22:53:29,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {2143#true} call #t~ret7 := main(); {2143#true} is VALID [2018-11-18 22:53:29,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {2143#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2145#(= main_~i~0 0)} is VALID [2018-11-18 22:53:29,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {2145#(= main_~i~0 0)} assume true; {2145#(= main_~i~0 0)} is VALID [2018-11-18 22:53:29,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {2145#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2146#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:29,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {2146#(<= main_~i~0 1)} assume true; {2146#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:29,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {2146#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2147#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:29,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(<= main_~i~0 2)} assume true; {2147#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:29,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2148#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:29,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {2148#(<= main_~i~0 3)} assume true; {2148#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:29,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {2148#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2149#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:29,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {2149#(<= main_~i~0 4)} assume true; {2149#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:29,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {2149#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2150#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:29,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {2150#(<= main_~i~0 5)} assume true; {2150#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:29,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {2150#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-18 22:53:29,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {2144#false} ~i~0 := 0; {2144#false} is VALID [2018-11-18 22:53:29,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2144#false} is VALID [2018-11-18 22:53:29,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {2144#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2144#false} is VALID [2018-11-18 22:53:29,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2144#false} is VALID [2018-11-18 22:53:29,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {2144#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2144#false} is VALID [2018-11-18 22:53:29,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2144#false} is VALID [2018-11-18 22:53:29,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {2144#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2144#false} is VALID [2018-11-18 22:53:29,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2144#false} is VALID [2018-11-18 22:53:29,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {2144#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2144#false} is VALID [2018-11-18 22:53:29,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2144#false} is VALID [2018-11-18 22:53:29,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {2144#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2144#false} is VALID [2018-11-18 22:53:29,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {2144#false} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-18 22:53:29,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {2144#false} ~i~0 := 0; {2144#false} is VALID [2018-11-18 22:53:29,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:29,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:29,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:29,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:29,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:29,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:29,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,206 INFO L273 TraceCheckUtils]: 47: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:29,207 INFO L273 TraceCheckUtils]: 48: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:29,207 INFO L273 TraceCheckUtils]: 49: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,207 INFO L273 TraceCheckUtils]: 50: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:29,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:29,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {2144#false} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-18 22:53:29,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {2144#false} havoc ~x~0;~x~0 := 0; {2144#false} is VALID [2018-11-18 22:53:29,208 INFO L273 TraceCheckUtils]: 55: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:29,208 INFO L273 TraceCheckUtils]: 56: Hoare triple {2144#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2144#false} is VALID [2018-11-18 22:53:29,209 INFO L256 TraceCheckUtils]: 57: Hoare triple {2144#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2144#false} is VALID [2018-11-18 22:53:29,209 INFO L273 TraceCheckUtils]: 58: Hoare triple {2144#false} ~cond := #in~cond; {2144#false} is VALID [2018-11-18 22:53:29,209 INFO L273 TraceCheckUtils]: 59: Hoare triple {2144#false} assume 0 == ~cond; {2144#false} is VALID [2018-11-18 22:53:29,209 INFO L273 TraceCheckUtils]: 60: Hoare triple {2144#false} assume !false; {2144#false} is VALID [2018-11-18 22:53:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 22:53:29,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:29,213 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-18 22:53:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:53:29,853 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:53:29,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:29,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:30,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {2143#true} call ULTIMATE.init(); {2143#true} is VALID [2018-11-18 22:53:30,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {2143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2143#true} is VALID [2018-11-18 22:53:30,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2143#true} {2143#true} #80#return; {2143#true} is VALID [2018-11-18 22:53:30,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {2143#true} call #t~ret7 := main(); {2143#true} is VALID [2018-11-18 22:53:30,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {2143#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2143#true} is VALID [2018-11-18 22:53:30,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2143#true} is VALID [2018-11-18 22:53:30,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2143#true} is VALID [2018-11-18 22:53:30,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2143#true} is VALID [2018-11-18 22:53:30,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2143#true} is VALID [2018-11-18 22:53:30,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2143#true} is VALID [2018-11-18 22:53:30,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-18 22:53:30,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {2143#true} assume !(~i~0 < 100000); {2143#true} is VALID [2018-11-18 22:53:30,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {2143#true} ~i~0 := 0; {2208#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:30,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {2208#(<= main_~i~0 0)} assume true; {2208#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:30,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {2208#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2208#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:30,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {2208#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2146#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:30,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {2146#(<= main_~i~0 1)} assume true; {2146#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:30,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {2146#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2146#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:30,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {2146#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2147#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:30,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {2147#(<= main_~i~0 2)} assume true; {2147#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:30,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {2147#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2147#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:30,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {2147#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2148#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:30,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {2148#(<= main_~i~0 3)} assume true; {2148#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:30,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {2148#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2148#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:30,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {2148#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2149#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:30,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {2149#(<= main_~i~0 4)} assume true; {2149#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:30,106 INFO L273 TraceCheckUtils]: 32: Hoare triple {2149#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2149#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:30,107 INFO L273 TraceCheckUtils]: 33: Hoare triple {2149#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2150#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:30,108 INFO L273 TraceCheckUtils]: 34: Hoare triple {2150#(<= main_~i~0 5)} assume true; {2150#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:30,109 INFO L273 TraceCheckUtils]: 35: Hoare triple {2150#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-18 22:53:30,109 INFO L273 TraceCheckUtils]: 36: Hoare triple {2144#false} ~i~0 := 0; {2144#false} is VALID [2018-11-18 22:53:30,109 INFO L273 TraceCheckUtils]: 37: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,109 INFO L273 TraceCheckUtils]: 38: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:30,110 INFO L273 TraceCheckUtils]: 39: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:30,110 INFO L273 TraceCheckUtils]: 40: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,110 INFO L273 TraceCheckUtils]: 41: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:30,111 INFO L273 TraceCheckUtils]: 42: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:30,111 INFO L273 TraceCheckUtils]: 43: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,111 INFO L273 TraceCheckUtils]: 44: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:30,111 INFO L273 TraceCheckUtils]: 45: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:30,112 INFO L273 TraceCheckUtils]: 46: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:30,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:30,113 INFO L273 TraceCheckUtils]: 49: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2144#false} is VALID [2018-11-18 22:53:30,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {2144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2144#false} is VALID [2018-11-18 22:53:30,113 INFO L273 TraceCheckUtils]: 52: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,113 INFO L273 TraceCheckUtils]: 53: Hoare triple {2144#false} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-18 22:53:30,113 INFO L273 TraceCheckUtils]: 54: Hoare triple {2144#false} havoc ~x~0;~x~0 := 0; {2144#false} is VALID [2018-11-18 22:53:30,114 INFO L273 TraceCheckUtils]: 55: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-18 22:53:30,114 INFO L273 TraceCheckUtils]: 56: Hoare triple {2144#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2144#false} is VALID [2018-11-18 22:53:30,114 INFO L256 TraceCheckUtils]: 57: Hoare triple {2144#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2144#false} is VALID [2018-11-18 22:53:30,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {2144#false} ~cond := #in~cond; {2144#false} is VALID [2018-11-18 22:53:30,114 INFO L273 TraceCheckUtils]: 59: Hoare triple {2144#false} assume 0 == ~cond; {2144#false} is VALID [2018-11-18 22:53:30,115 INFO L273 TraceCheckUtils]: 60: Hoare triple {2144#false} assume !false; {2144#false} is VALID [2018-11-18 22:53:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 22:53:30,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:30,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:53:30,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 22:53:30,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:30,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:53:30,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:30,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:53:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:53:30,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:53:30,306 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2018-11-18 22:53:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:30,973 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-11-18 22:53:30,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:53:30,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 22:53:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:53:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-18 22:53:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:53:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-18 22:53:30,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2018-11-18 22:53:31,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:31,314 INFO L225 Difference]: With dead ends: 124 [2018-11-18 22:53:31,314 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 22:53:31,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 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-18 22:53:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 22:53:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-18 22:53:31,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:31,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-18 22:53:31,408 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-18 22:53:31,408 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-18 22:53:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:31,412 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-18 22:53:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-18 22:53:31,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:31,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:31,413 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-18 22:53:31,413 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-18 22:53:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:31,415 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-18 22:53:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-18 22:53:31,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:31,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:31,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:31,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 22:53:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-18 22:53:31,419 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 61 [2018-11-18 22:53:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:31,419 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-18 22:53:31,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:53:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-18 22:53:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 22:53:31,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:31,420 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:31,421 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:31,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1657777251, now seen corresponding path program 6 times [2018-11-18 22:53:31,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:31,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:31,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:31,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {2755#true} call ULTIMATE.init(); {2755#true} is VALID [2018-11-18 22:53:31,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {2755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2755#true} is VALID [2018-11-18 22:53:31,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:31,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #80#return; {2755#true} is VALID [2018-11-18 22:53:31,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret7 := main(); {2755#true} is VALID [2018-11-18 22:53:31,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {2755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2757#(= main_~i~0 0)} is VALID [2018-11-18 22:53:31,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {2757#(= main_~i~0 0)} assume true; {2757#(= main_~i~0 0)} is VALID [2018-11-18 22:53:31,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {2757#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2758#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:31,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {2758#(<= main_~i~0 1)} assume true; {2758#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:31,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {2758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2759#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:31,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {2759#(<= main_~i~0 2)} assume true; {2759#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:31,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {2759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2760#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:31,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {2760#(<= main_~i~0 3)} assume true; {2760#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:31,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {2760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2761#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:31,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#(<= main_~i~0 4)} assume true; {2761#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:31,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2762#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:31,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {2762#(<= main_~i~0 5)} assume true; {2762#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:31,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {2762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2763#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:31,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {2763#(<= main_~i~0 6)} assume true; {2763#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:31,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {2763#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-18 22:53:31,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {2756#false} ~i~0 := 0; {2756#false} is VALID [2018-11-18 22:53:31,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2756#false} is VALID [2018-11-18 22:53:31,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {2756#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2756#false} is VALID [2018-11-18 22:53:31,596 INFO L273 TraceCheckUtils]: 24: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2756#false} is VALID [2018-11-18 22:53:31,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {2756#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2756#false} is VALID [2018-11-18 22:53:31,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2756#false} is VALID [2018-11-18 22:53:31,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {2756#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2756#false} is VALID [2018-11-18 22:53:31,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2756#false} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {2756#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2756#false} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2756#false} is VALID [2018-11-18 22:53:31,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {2756#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2756#false} is VALID [2018-11-18 22:53:31,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2756#false} is VALID [2018-11-18 22:53:31,599 INFO L273 TraceCheckUtils]: 38: Hoare triple {2756#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2756#false} is VALID [2018-11-18 22:53:31,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {2756#false} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {2756#false} ~i~0 := 0; {2756#false} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:31,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 46: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:31,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 52: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 53: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 54: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 55: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 56: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:31,602 INFO L273 TraceCheckUtils]: 57: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 58: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 59: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 60: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 61: Hoare triple {2756#false} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 62: Hoare triple {2756#false} havoc ~x~0;~x~0 := 0; {2756#false} is VALID [2018-11-18 22:53:31,603 INFO L273 TraceCheckUtils]: 63: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:31,604 INFO L273 TraceCheckUtils]: 64: Hoare triple {2756#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2756#false} is VALID [2018-11-18 22:53:31,604 INFO L256 TraceCheckUtils]: 65: Hoare triple {2756#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2756#false} is VALID [2018-11-18 22:53:31,604 INFO L273 TraceCheckUtils]: 66: Hoare triple {2756#false} ~cond := #in~cond; {2756#false} is VALID [2018-11-18 22:53:31,604 INFO L273 TraceCheckUtils]: 67: Hoare triple {2756#false} assume 0 == ~cond; {2756#false} is VALID [2018-11-18 22:53:31,604 INFO L273 TraceCheckUtils]: 68: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2018-11-18 22:53:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:53:31,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:31,608 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-18 22:53:31,620 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:53:31,913 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:53:31,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:31,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:32,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {2755#true} call ULTIMATE.init(); {2755#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {2755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2755#true} is VALID [2018-11-18 22:53:32,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #80#return; {2755#true} is VALID [2018-11-18 22:53:32,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret7 := main(); {2755#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {2755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {2755#true} is VALID [2018-11-18 22:53:32,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2755#true} is VALID [2018-11-18 22:53:32,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2755#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2755#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-18 22:53:32,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {2755#true} assume !(~i~0 < 100000); {2755#true} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {2755#true} ~i~0 := 0; {2827#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {2827#(<= main_~i~0 0)} assume true; {2827#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:32,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {2827#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2827#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {2827#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2758#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {2758#(<= main_~i~0 1)} assume true; {2758#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:32,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {2758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2758#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {2758#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2759#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:32,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {2759#(<= main_~i~0 2)} assume true; {2759#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {2759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2759#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:32,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {2759#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2760#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:32,072 INFO L273 TraceCheckUtils]: 30: Hoare triple {2760#(<= main_~i~0 3)} assume true; {2760#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:32,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {2760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2760#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:32,073 INFO L273 TraceCheckUtils]: 32: Hoare triple {2760#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2761#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:32,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#(<= main_~i~0 4)} assume true; {2761#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:32,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {2761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2761#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:32,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {2761#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2762#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:32,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {2762#(<= main_~i~0 5)} assume true; {2762#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:32,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {2762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {2762#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:32,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {2762#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2763#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:32,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {2763#(<= main_~i~0 6)} assume true; {2763#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:32,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {2763#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-18 22:53:32,078 INFO L273 TraceCheckUtils]: 41: Hoare triple {2756#false} ~i~0 := 0; {2756#false} is VALID [2018-11-18 22:53:32,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:32,079 INFO L273 TraceCheckUtils]: 44: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:32,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:32,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:32,080 INFO L273 TraceCheckUtils]: 48: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,080 INFO L273 TraceCheckUtils]: 49: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:32,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:32,081 INFO L273 TraceCheckUtils]: 51: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:32,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:32,081 INFO L273 TraceCheckUtils]: 54: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:32,082 INFO L273 TraceCheckUtils]: 56: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:32,082 INFO L273 TraceCheckUtils]: 57: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,082 INFO L273 TraceCheckUtils]: 58: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#false} is VALID [2018-11-18 22:53:32,082 INFO L273 TraceCheckUtils]: 59: Hoare triple {2756#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#false} is VALID [2018-11-18 22:53:32,083 INFO L273 TraceCheckUtils]: 60: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,083 INFO L273 TraceCheckUtils]: 61: Hoare triple {2756#false} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-18 22:53:32,083 INFO L273 TraceCheckUtils]: 62: Hoare triple {2756#false} havoc ~x~0;~x~0 := 0; {2756#false} is VALID [2018-11-18 22:53:32,083 INFO L273 TraceCheckUtils]: 63: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-18 22:53:32,084 INFO L273 TraceCheckUtils]: 64: Hoare triple {2756#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2756#false} is VALID [2018-11-18 22:53:32,084 INFO L256 TraceCheckUtils]: 65: Hoare triple {2756#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {2756#false} is VALID [2018-11-18 22:53:32,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {2756#false} ~cond := #in~cond; {2756#false} is VALID [2018-11-18 22:53:32,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {2756#false} assume 0 == ~cond; {2756#false} is VALID [2018-11-18 22:53:32,084 INFO L273 TraceCheckUtils]: 68: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2018-11-18 22:53:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 22:53:32,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:32,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:53:32,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-11-18 22:53:32,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:32,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:53:32,168 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-18 22:53:32,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:53:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:53:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:53:32,170 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 10 states. [2018-11-18 22:53:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:32,577 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-18 22:53:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:53:32,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-11-18 22:53:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:53:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2018-11-18 22:53:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:53:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2018-11-18 22:53:32,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2018-11-18 22:53:32,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:32,761 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:53:32,761 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 22:53:32,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 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-18 22:53:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 22:53:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-18 22:53:32,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:32,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-18 22:53:32,791 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-18 22:53:32,791 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-18 22:53:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:32,795 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-18 22:53:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-18 22:53:32,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:32,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:32,795 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-18 22:53:32,795 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-18 22:53:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:32,798 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-18 22:53:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-18 22:53:32,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:32,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:32,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:32,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 22:53:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-18 22:53:32,801 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 69 [2018-11-18 22:53:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:32,801 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-18 22:53:32,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:53:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-18 22:53:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 22:53:32,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:32,802 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:32,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:32,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:32,803 INFO L82 PathProgramCache]: Analyzing trace with hash 82128276, now seen corresponding path program 7 times [2018-11-18 22:53:32,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:32,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:32,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:33,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {3438#true} call ULTIMATE.init(); {3438#true} is VALID [2018-11-18 22:53:33,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {3438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3438#true} is VALID [2018-11-18 22:53:33,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {3438#true} assume true; {3438#true} is VALID [2018-11-18 22:53:33,057 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3438#true} {3438#true} #80#return; {3438#true} is VALID [2018-11-18 22:53:33,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {3438#true} call #t~ret7 := main(); {3438#true} is VALID [2018-11-18 22:53:33,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {3438#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {3440#(= main_~i~0 0)} is VALID [2018-11-18 22:53:33,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {3440#(= main_~i~0 0)} assume true; {3440#(= main_~i~0 0)} is VALID [2018-11-18 22:53:33,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {3440#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:33,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {3441#(<= main_~i~0 1)} assume true; {3441#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:33,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {3441#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3442#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:33,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {3442#(<= main_~i~0 2)} assume true; {3442#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:33,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {3442#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:33,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {3443#(<= main_~i~0 3)} assume true; {3443#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:33,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {3443#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3444#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:33,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 4)} assume true; {3444#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:33,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3445#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:33,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 5)} assume true; {3445#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:33,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3446#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:33,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {3446#(<= main_~i~0 6)} assume true; {3446#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:33,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {3446#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3447#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:33,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {3447#(<= main_~i~0 7)} assume true; {3447#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:33,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {3447#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-18 22:53:33,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-18 22:53:33,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,073 INFO L273 TraceCheckUtils]: 31: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,073 INFO L273 TraceCheckUtils]: 32: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,073 INFO L273 TraceCheckUtils]: 34: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 36: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 37: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 43: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 45: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 46: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 47: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 48: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 55: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 57: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,077 INFO L273 TraceCheckUtils]: 62: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,078 INFO L273 TraceCheckUtils]: 65: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,078 INFO L273 TraceCheckUtils]: 66: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,078 INFO L273 TraceCheckUtils]: 68: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,078 INFO L273 TraceCheckUtils]: 69: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-18 22:53:33,079 INFO L273 TraceCheckUtils]: 70: Hoare triple {3439#false} havoc ~x~0;~x~0 := 0; {3439#false} is VALID [2018-11-18 22:53:33,079 INFO L273 TraceCheckUtils]: 71: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,079 INFO L273 TraceCheckUtils]: 72: Hoare triple {3439#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3439#false} is VALID [2018-11-18 22:53:33,079 INFO L256 TraceCheckUtils]: 73: Hoare triple {3439#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {3439#false} is VALID [2018-11-18 22:53:33,079 INFO L273 TraceCheckUtils]: 74: Hoare triple {3439#false} ~cond := #in~cond; {3439#false} is VALID [2018-11-18 22:53:33,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {3439#false} assume 0 == ~cond; {3439#false} is VALID [2018-11-18 22:53:33,080 INFO L273 TraceCheckUtils]: 76: Hoare triple {3439#false} assume !false; {3439#false} is VALID [2018-11-18 22:53:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-18 22:53:33,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:33,084 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-18 22:53:33,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:33,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:33,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {3438#true} call ULTIMATE.init(); {3438#true} is VALID [2018-11-18 22:53:33,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {3438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3438#true} is VALID [2018-11-18 22:53:33,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {3438#true} assume true; {3438#true} is VALID [2018-11-18 22:53:33,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3438#true} {3438#true} #80#return; {3438#true} is VALID [2018-11-18 22:53:33,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {3438#true} call #t~ret7 := main(); {3438#true} is VALID [2018-11-18 22:53:33,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {3438#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {3466#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:33,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {3466#(<= main_~i~0 0)} assume true; {3466#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:33,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:33,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {3441#(<= main_~i~0 1)} assume true; {3441#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:33,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {3441#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3442#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:33,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {3442#(<= main_~i~0 2)} assume true; {3442#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:33,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {3442#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3443#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:33,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {3443#(<= main_~i~0 3)} assume true; {3443#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:33,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {3443#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3444#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:33,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 4)} assume true; {3444#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:33,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3445#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:33,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 5)} assume true; {3445#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:33,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3446#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:33,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {3446#(<= main_~i~0 6)} assume true; {3446#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:33,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {3446#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3447#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:33,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {3447#(<= main_~i~0 7)} assume true; {3447#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:33,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {3447#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-18 22:53:33,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-18 22:53:33,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,690 INFO L273 TraceCheckUtils]: 30: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {3439#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 46: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 47: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,692 INFO L273 TraceCheckUtils]: 49: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 56: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 59: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 63: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,694 INFO L273 TraceCheckUtils]: 65: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 66: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 67: Hoare triple {3439#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 68: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 69: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 70: Hoare triple {3439#false} havoc ~x~0;~x~0 := 0; {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 71: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L273 TraceCheckUtils]: 72: Hoare triple {3439#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3439#false} is VALID [2018-11-18 22:53:33,695 INFO L256 TraceCheckUtils]: 73: Hoare triple {3439#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {3439#false} is VALID [2018-11-18 22:53:33,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {3439#false} ~cond := #in~cond; {3439#false} is VALID [2018-11-18 22:53:33,696 INFO L273 TraceCheckUtils]: 75: Hoare triple {3439#false} assume 0 == ~cond; {3439#false} is VALID [2018-11-18 22:53:33,696 INFO L273 TraceCheckUtils]: 76: Hoare triple {3439#false} assume !false; {3439#false} is VALID [2018-11-18 22:53:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-18 22:53:33,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:33,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:53:33,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-18 22:53:33,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:33,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:53:33,836 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-18 22:53:33,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:53:33,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:53:33,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:53:33,837 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 11 states. [2018-11-18 22:53:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:34,203 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-18 22:53:34,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:53:34,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-18 22:53:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:53:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-18 22:53:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:53:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-18 22:53:34,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 120 transitions. [2018-11-18 22:53:34,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:34,341 INFO L225 Difference]: With dead ends: 152 [2018-11-18 22:53:34,342 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 22:53:34,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 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-18 22:53:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 22:53:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 22:53:34,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:34,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-18 22:53:34,378 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-18 22:53:34,378 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-18 22:53:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:34,382 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-18 22:53:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-18 22:53:34,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:34,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:34,383 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-18 22:53:34,383 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-18 22:53:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:34,386 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-18 22:53:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-18 22:53:34,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:34,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:34,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:34,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 22:53:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-11-18 22:53:34,390 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 77 [2018-11-18 22:53:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:34,391 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-11-18 22:53:34,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:53:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-18 22:53:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 22:53:34,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:34,392 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:34,392 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:34,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash 494131825, now seen corresponding path program 8 times [2018-11-18 22:53:34,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:34,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:34,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:53:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:34,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-18 22:53:34,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-18 22:53:34,623 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-18 22:53:34,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #80#return; {4192#true} is VALID [2018-11-18 22:53:34,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2018-11-18 22:53:34,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {4194#(= main_~i~0 0)} is VALID [2018-11-18 22:53:34,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {4194#(= main_~i~0 0)} assume true; {4194#(= main_~i~0 0)} is VALID [2018-11-18 22:53:34,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {4194#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4195#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:34,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 1)} assume true; {4195#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:34,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4196#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:34,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~i~0 2)} assume true; {4196#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:34,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4197#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:34,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~i~0 3)} assume true; {4197#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:34,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4198#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:34,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~i~0 4)} assume true; {4198#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:34,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4199#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:34,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~i~0 5)} assume true; {4199#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:34,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4200#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:34,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~i~0 6)} assume true; {4200#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:34,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4201#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:34,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~i~0 7)} assume true; {4201#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:34,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4202#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:34,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume true; {4202#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:34,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-18 22:53:34,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-18 22:53:34,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,672 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 51: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 61: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 69: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 70: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 71: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 72: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 73: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,675 INFO L273 TraceCheckUtils]: 74: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 76: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 77: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 78: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 80: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L256 TraceCheckUtils]: 81: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 82: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-18 22:53:34,676 INFO L273 TraceCheckUtils]: 83: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2018-11-18 22:53:34,677 INFO L273 TraceCheckUtils]: 84: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-18 22:53:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 22:53:34,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:34,684 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-18 22:53:34,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:53:34,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:53:34,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:34,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:34,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-18 22:53:34,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-18 22:53:34,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-18 22:53:34,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #80#return; {4192#true} is VALID [2018-11-18 22:53:34,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2018-11-18 22:53:34,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {4221#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:34,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {4221#(<= main_~i~0 0)} assume true; {4221#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:34,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {4221#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4195#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:34,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 1)} assume true; {4195#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:34,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4196#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:34,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~i~0 2)} assume true; {4196#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:34,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4197#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:34,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~i~0 3)} assume true; {4197#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:34,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4198#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:34,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~i~0 4)} assume true; {4198#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:34,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4199#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:34,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~i~0 5)} assume true; {4199#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:34,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4200#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:34,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~i~0 6)} assume true; {4200#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:34,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4201#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:34,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~i~0 7)} assume true; {4201#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:34,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4202#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:34,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume true; {4202#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:34,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-18 22:53:34,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-18 22:53:34,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,949 INFO L273 TraceCheckUtils]: 29: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,952 INFO L273 TraceCheckUtils]: 43: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,952 INFO L273 TraceCheckUtils]: 44: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {4193#false} is VALID [2018-11-18 22:53:34,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4193#false} is VALID [2018-11-18 22:53:34,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,953 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 52: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 58: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,954 INFO L273 TraceCheckUtils]: 59: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 61: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 62: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 63: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 64: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 65: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 66: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,955 INFO L273 TraceCheckUtils]: 67: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 68: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 69: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 70: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 71: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 72: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 73: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 74: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 75: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-18 22:53:34,956 INFO L273 TraceCheckUtils]: 76: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 77: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 78: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 79: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 80: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L256 TraceCheckUtils]: 81: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 82: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 83: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2018-11-18 22:53:34,957 INFO L273 TraceCheckUtils]: 84: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-18 22:53:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 22:53:34,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:34,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:53:34,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-18 22:53:34,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:34,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:53:35,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:35,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:53:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:53:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:35,023 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 12 states. [2018-11-18 22:53:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:35,435 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-18 22:53:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:53:35,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-18 22:53:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2018-11-18 22:53:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:53:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2018-11-18 22:53:35,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2018-11-18 22:53:35,628 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-18 22:53:35,631 INFO L225 Difference]: With dead ends: 166 [2018-11-18 22:53:35,631 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 22:53:35,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:53:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 22:53:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-18 22:53:36,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:36,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-18 22:53:36,238 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-18 22:53:36,238 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-18 22:53:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:36,240 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-11-18 22:53:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-11-18 22:53:36,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:36,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:36,241 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-18 22:53:36,241 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-18 22:53:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:36,244 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-11-18 22:53:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-11-18 22:53:36,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:36,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:36,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:36,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 22:53:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-18 22:53:36,248 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 85 [2018-11-18 22:53:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:36,248 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-18 22:53:36,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:53:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-18 22:53:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 22:53:36,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:36,250 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:36,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:36,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash -286500952, now seen corresponding path program 9 times [2018-11-18 22:53:36,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:36,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:36,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:36,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:36,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:36,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {5017#true} call ULTIMATE.init(); {5017#true} is VALID [2018-11-18 22:53:36,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {5017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5017#true} is VALID [2018-11-18 22:53:36,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:36,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5017#true} {5017#true} #80#return; {5017#true} is VALID [2018-11-18 22:53:36,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {5017#true} call #t~ret7 := main(); {5017#true} is VALID [2018-11-18 22:53:36,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {5017#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5019#(= main_~i~0 0)} is VALID [2018-11-18 22:53:36,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {5019#(= main_~i~0 0)} assume true; {5019#(= main_~i~0 0)} is VALID [2018-11-18 22:53:36,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {5019#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5020#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:36,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {5020#(<= main_~i~0 1)} assume true; {5020#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:36,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {5020#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5021#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:36,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {5021#(<= main_~i~0 2)} assume true; {5021#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:36,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {5021#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5022#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:36,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {5022#(<= main_~i~0 3)} assume true; {5022#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:37,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {5022#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5023#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:37,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {5023#(<= main_~i~0 4)} assume true; {5023#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:37,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {5023#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5024#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:37,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {5024#(<= main_~i~0 5)} assume true; {5024#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:37,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {5024#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5025#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:37,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {5025#(<= main_~i~0 6)} assume true; {5025#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:37,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {5025#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5026#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:37,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {5026#(<= main_~i~0 7)} assume true; {5026#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:37,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {5026#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5027#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:37,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {5027#(<= main_~i~0 8)} assume true; {5027#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:37,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {5027#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5028#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:37,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {5028#(<= main_~i~0 9)} assume true; {5028#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:37,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {5028#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-18 22:53:37,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {5018#false} ~i~0 := 0; {5018#false} is VALID [2018-11-18 22:53:37,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,011 INFO L273 TraceCheckUtils]: 28: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,012 INFO L273 TraceCheckUtils]: 30: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 38: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 39: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 40: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 41: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,014 INFO L273 TraceCheckUtils]: 44: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,015 INFO L273 TraceCheckUtils]: 45: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,015 INFO L273 TraceCheckUtils]: 46: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 52: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {5018#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 55: Hoare triple {5018#false} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 56: Hoare triple {5018#false} ~i~0 := 0; {5018#false} is VALID [2018-11-18 22:53:37,016 INFO L273 TraceCheckUtils]: 57: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,017 INFO L273 TraceCheckUtils]: 58: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,017 INFO L273 TraceCheckUtils]: 61: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,017 INFO L273 TraceCheckUtils]: 62: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,017 INFO L273 TraceCheckUtils]: 63: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 64: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 65: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 66: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 67: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 69: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,018 INFO L273 TraceCheckUtils]: 70: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,019 INFO L273 TraceCheckUtils]: 72: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,019 INFO L273 TraceCheckUtils]: 73: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,019 INFO L273 TraceCheckUtils]: 74: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,019 INFO L273 TraceCheckUtils]: 75: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,019 INFO L273 TraceCheckUtils]: 76: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 77: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 78: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 79: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 80: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 82: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5018#false} is VALID [2018-11-18 22:53:37,020 INFO L273 TraceCheckUtils]: 83: Hoare triple {5018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5018#false} is VALID [2018-11-18 22:53:37,021 INFO L273 TraceCheckUtils]: 84: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,021 INFO L273 TraceCheckUtils]: 85: Hoare triple {5018#false} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-18 22:53:37,021 INFO L273 TraceCheckUtils]: 86: Hoare triple {5018#false} havoc ~x~0;~x~0 := 0; {5018#false} is VALID [2018-11-18 22:53:37,021 INFO L273 TraceCheckUtils]: 87: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:37,021 INFO L273 TraceCheckUtils]: 88: Hoare triple {5018#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5018#false} is VALID [2018-11-18 22:53:37,021 INFO L256 TraceCheckUtils]: 89: Hoare triple {5018#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5018#false} is VALID [2018-11-18 22:53:37,022 INFO L273 TraceCheckUtils]: 90: Hoare triple {5018#false} ~cond := #in~cond; {5018#false} is VALID [2018-11-18 22:53:37,022 INFO L273 TraceCheckUtils]: 91: Hoare triple {5018#false} assume 0 == ~cond; {5018#false} is VALID [2018-11-18 22:53:37,022 INFO L273 TraceCheckUtils]: 92: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2018-11-18 22:53:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 22:53:37,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:37,030 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-18 22:53:37,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:53:39,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:53:39,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:39,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:39,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {5017#true} call ULTIMATE.init(); {5017#true} is VALID [2018-11-18 22:53:39,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {5017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5017#true} is VALID [2018-11-18 22:53:39,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5017#true} {5017#true} #80#return; {5017#true} is VALID [2018-11-18 22:53:39,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {5017#true} call #t~ret7 := main(); {5017#true} is VALID [2018-11-18 22:53:39,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {5017#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5017#true} is VALID [2018-11-18 22:53:39,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#true} is VALID [2018-11-18 22:53:39,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {5017#true} assume !(~i~0 < 100000); {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 26: Hoare triple {5017#true} ~i~0 := 0; {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,703 INFO L273 TraceCheckUtils]: 39: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,703 INFO L273 TraceCheckUtils]: 40: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,703 INFO L273 TraceCheckUtils]: 44: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 46: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 47: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5017#true} is VALID [2018-11-18 22:53:39,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {5017#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5017#true} is VALID [2018-11-18 22:53:39,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-18 22:53:39,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {5017#true} assume !(~i~0 < 100000); {5017#true} is VALID [2018-11-18 22:53:39,706 INFO L273 TraceCheckUtils]: 56: Hoare triple {5017#true} ~i~0 := 0; {5200#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:39,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {5200#(<= main_~i~0 0)} assume true; {5200#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:39,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {5200#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5200#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:39,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {5200#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5020#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:39,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {5020#(<= main_~i~0 1)} assume true; {5020#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:39,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {5020#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5020#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:39,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {5020#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5021#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:39,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {5021#(<= main_~i~0 2)} assume true; {5021#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:39,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {5021#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5021#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:39,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {5021#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5022#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:39,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {5022#(<= main_~i~0 3)} assume true; {5022#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:39,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {5022#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5022#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:39,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {5022#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5023#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:39,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {5023#(<= main_~i~0 4)} assume true; {5023#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:39,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {5023#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5023#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:39,714 INFO L273 TraceCheckUtils]: 71: Hoare triple {5023#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5024#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:39,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {5024#(<= main_~i~0 5)} assume true; {5024#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:39,715 INFO L273 TraceCheckUtils]: 73: Hoare triple {5024#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5024#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:39,716 INFO L273 TraceCheckUtils]: 74: Hoare triple {5024#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5025#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:39,716 INFO L273 TraceCheckUtils]: 75: Hoare triple {5025#(<= main_~i~0 6)} assume true; {5025#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:39,717 INFO L273 TraceCheckUtils]: 76: Hoare triple {5025#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5025#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:39,718 INFO L273 TraceCheckUtils]: 77: Hoare triple {5025#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5026#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:39,718 INFO L273 TraceCheckUtils]: 78: Hoare triple {5026#(<= main_~i~0 7)} assume true; {5026#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:39,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {5026#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5026#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:39,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {5026#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5027#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:39,720 INFO L273 TraceCheckUtils]: 81: Hoare triple {5027#(<= main_~i~0 8)} assume true; {5027#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:39,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {5027#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5027#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:39,722 INFO L273 TraceCheckUtils]: 83: Hoare triple {5027#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5028#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:39,722 INFO L273 TraceCheckUtils]: 84: Hoare triple {5028#(<= main_~i~0 9)} assume true; {5028#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:39,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {5028#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-18 22:53:39,723 INFO L273 TraceCheckUtils]: 86: Hoare triple {5018#false} havoc ~x~0;~x~0 := 0; {5018#false} is VALID [2018-11-18 22:53:39,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-18 22:53:39,724 INFO L273 TraceCheckUtils]: 88: Hoare triple {5018#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5018#false} is VALID [2018-11-18 22:53:39,724 INFO L256 TraceCheckUtils]: 89: Hoare triple {5018#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5018#false} is VALID [2018-11-18 22:53:39,724 INFO L273 TraceCheckUtils]: 90: Hoare triple {5018#false} ~cond := #in~cond; {5018#false} is VALID [2018-11-18 22:53:39,725 INFO L273 TraceCheckUtils]: 91: Hoare triple {5018#false} assume 0 == ~cond; {5018#false} is VALID [2018-11-18 22:53:39,725 INFO L273 TraceCheckUtils]: 92: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2018-11-18 22:53:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-18 22:53:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:53:39,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-11-18 22:53:39,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:39,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:53:39,843 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-18 22:53:39,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:53:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:53:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:53:39,844 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 13 states. [2018-11-18 22:53:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:40,285 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-18 22:53:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:53:40,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-11-18 22:53:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:53:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2018-11-18 22:53:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:53:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2018-11-18 22:53:40,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 136 transitions. [2018-11-18 22:53:40,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:40,415 INFO L225 Difference]: With dead ends: 180 [2018-11-18 22:53:40,415 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 22:53:40,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:53:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 22:53:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-18 22:53:40,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:40,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 106 states. [2018-11-18 22:53:40,608 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 106 states. [2018-11-18 22:53:40,609 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 106 states. [2018-11-18 22:53:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:40,610 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-18 22:53:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-18 22:53:40,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:40,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:40,611 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 108 states. [2018-11-18 22:53:40,611 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 108 states. [2018-11-18 22:53:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:40,613 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-18 22:53:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-18 22:53:40,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:40,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:40,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:40,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 22:53:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-11-18 22:53:40,616 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 93 [2018-11-18 22:53:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:40,617 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-11-18 22:53:40,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:53:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-18 22:53:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 22:53:40,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:40,618 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:40,618 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:40,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:40,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1060537157, now seen corresponding path program 10 times [2018-11-18 22:53:40,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:40,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:40,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:40,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {5913#true} call ULTIMATE.init(); {5913#true} is VALID [2018-11-18 22:53:40,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {5913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5913#true} is VALID [2018-11-18 22:53:40,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:40,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5913#true} {5913#true} #80#return; {5913#true} is VALID [2018-11-18 22:53:40,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {5913#true} call #t~ret7 := main(); {5913#true} is VALID [2018-11-18 22:53:40,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {5913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5915#(= main_~i~0 0)} is VALID [2018-11-18 22:53:40,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {5915#(= main_~i~0 0)} assume true; {5915#(= main_~i~0 0)} is VALID [2018-11-18 22:53:40,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {5915#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5916#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:40,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {5916#(<= main_~i~0 1)} assume true; {5916#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:40,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {5916#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5917#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:40,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {5917#(<= main_~i~0 2)} assume true; {5917#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:40,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {5917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5918#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:40,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {5918#(<= main_~i~0 3)} assume true; {5918#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:40,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {5918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5919#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:40,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {5919#(<= main_~i~0 4)} assume true; {5919#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:40,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {5919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5920#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:40,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {5920#(<= main_~i~0 5)} assume true; {5920#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:40,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {5920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5921#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:40,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {5921#(<= main_~i~0 6)} assume true; {5921#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:40,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {5921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5922#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:40,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {5922#(<= main_~i~0 7)} assume true; {5922#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:40,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {5922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5923#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:40,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {5923#(<= main_~i~0 8)} assume true; {5923#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:40,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {5923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5924#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:40,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {5924#(<= main_~i~0 9)} assume true; {5924#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:40,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {5924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5925#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:40,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {5925#(<= main_~i~0 10)} assume true; {5925#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:40,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {5925#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5914#false} is VALID [2018-11-18 22:53:40,892 INFO L273 TraceCheckUtils]: 28: Hoare triple {5914#false} ~i~0 := 0; {5914#false} is VALID [2018-11-18 22:53:40,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,893 INFO L273 TraceCheckUtils]: 35: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,894 INFO L273 TraceCheckUtils]: 37: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,894 INFO L273 TraceCheckUtils]: 38: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,895 INFO L273 TraceCheckUtils]: 41: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,896 INFO L273 TraceCheckUtils]: 46: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,897 INFO L273 TraceCheckUtils]: 54: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,898 INFO L273 TraceCheckUtils]: 57: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5914#false} is VALID [2018-11-18 22:53:40,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {5914#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5914#false} is VALID [2018-11-18 22:53:40,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {5914#false} assume !(~i~0 < 100000); {5914#false} is VALID [2018-11-18 22:53:40,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {5914#false} ~i~0 := 0; {5914#false} is VALID [2018-11-18 22:53:40,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,899 INFO L273 TraceCheckUtils]: 66: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,899 INFO L273 TraceCheckUtils]: 67: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,899 INFO L273 TraceCheckUtils]: 68: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,900 INFO L273 TraceCheckUtils]: 69: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,900 INFO L273 TraceCheckUtils]: 70: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,900 INFO L273 TraceCheckUtils]: 73: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,900 INFO L273 TraceCheckUtils]: 74: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,901 INFO L273 TraceCheckUtils]: 75: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,901 INFO L273 TraceCheckUtils]: 76: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,901 INFO L273 TraceCheckUtils]: 77: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,901 INFO L273 TraceCheckUtils]: 78: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,901 INFO L273 TraceCheckUtils]: 80: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,902 INFO L273 TraceCheckUtils]: 81: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,902 INFO L273 TraceCheckUtils]: 82: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,902 INFO L273 TraceCheckUtils]: 83: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,902 INFO L273 TraceCheckUtils]: 84: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,902 INFO L273 TraceCheckUtils]: 85: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,902 INFO L273 TraceCheckUtils]: 86: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 87: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 88: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 89: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 90: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 91: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 92: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 93: Hoare triple {5914#false} assume !(~i~0 < 100000); {5914#false} is VALID [2018-11-18 22:53:40,903 INFO L273 TraceCheckUtils]: 94: Hoare triple {5914#false} havoc ~x~0;~x~0 := 0; {5914#false} is VALID [2018-11-18 22:53:40,904 INFO L273 TraceCheckUtils]: 95: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:40,904 INFO L273 TraceCheckUtils]: 96: Hoare triple {5914#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5914#false} is VALID [2018-11-18 22:53:40,904 INFO L256 TraceCheckUtils]: 97: Hoare triple {5914#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5914#false} is VALID [2018-11-18 22:53:40,904 INFO L273 TraceCheckUtils]: 98: Hoare triple {5914#false} ~cond := #in~cond; {5914#false} is VALID [2018-11-18 22:53:40,904 INFO L273 TraceCheckUtils]: 99: Hoare triple {5914#false} assume 0 == ~cond; {5914#false} is VALID [2018-11-18 22:53:40,904 INFO L273 TraceCheckUtils]: 100: Hoare triple {5914#false} assume !false; {5914#false} is VALID [2018-11-18 22:53:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 22:53:40,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:40,909 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-18 22:53:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:53:40,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:53:40,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:40,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:41,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {5913#true} call ULTIMATE.init(); {5913#true} is VALID [2018-11-18 22:53:41,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {5913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5913#true} is VALID [2018-11-18 22:53:41,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5913#true} {5913#true} #80#return; {5913#true} is VALID [2018-11-18 22:53:41,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {5913#true} call #t~ret7 := main(); {5913#true} is VALID [2018-11-18 22:53:41,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {5913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {5913#true} is VALID [2018-11-18 22:53:41,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 19: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 20: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 21: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,234 INFO L273 TraceCheckUtils]: 24: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {5913#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5913#true} is VALID [2018-11-18 22:53:41,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {5913#true} assume true; {5913#true} is VALID [2018-11-18 22:53:41,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {5913#true} assume !(~i~0 < 100000); {5913#true} is VALID [2018-11-18 22:53:41,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {5913#true} ~i~0 := 0; {6013#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:41,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {6013#(<= main_~i~0 0)} assume true; {6013#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:41,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {6013#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6013#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:41,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {6013#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5916#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:41,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {5916#(<= main_~i~0 1)} assume true; {5916#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:41,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {5916#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5916#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:41,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {5916#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5917#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:41,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {5917#(<= main_~i~0 2)} assume true; {5917#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:41,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {5917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5917#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:41,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {5917#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5918#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:41,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {5918#(<= main_~i~0 3)} assume true; {5918#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:41,239 INFO L273 TraceCheckUtils]: 39: Hoare triple {5918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5918#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:41,239 INFO L273 TraceCheckUtils]: 40: Hoare triple {5918#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5919#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:41,240 INFO L273 TraceCheckUtils]: 41: Hoare triple {5919#(<= main_~i~0 4)} assume true; {5919#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:41,241 INFO L273 TraceCheckUtils]: 42: Hoare triple {5919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5919#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:41,241 INFO L273 TraceCheckUtils]: 43: Hoare triple {5919#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5920#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:41,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {5920#(<= main_~i~0 5)} assume true; {5920#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:41,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {5920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5920#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:41,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {5920#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5921#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:41,244 INFO L273 TraceCheckUtils]: 47: Hoare triple {5921#(<= main_~i~0 6)} assume true; {5921#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:41,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {5921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5921#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:41,245 INFO L273 TraceCheckUtils]: 49: Hoare triple {5921#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5922#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:41,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {5922#(<= main_~i~0 7)} assume true; {5922#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:41,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {5922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5922#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:41,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {5922#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5923#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:41,247 INFO L273 TraceCheckUtils]: 53: Hoare triple {5923#(<= main_~i~0 8)} assume true; {5923#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:41,248 INFO L273 TraceCheckUtils]: 54: Hoare triple {5923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5923#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:41,249 INFO L273 TraceCheckUtils]: 55: Hoare triple {5923#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5924#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:41,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {5924#(<= main_~i~0 9)} assume true; {5924#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:41,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {5924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {5924#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:41,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {5924#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5925#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:41,251 INFO L273 TraceCheckUtils]: 59: Hoare triple {5925#(<= main_~i~0 10)} assume true; {5925#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:41,252 INFO L273 TraceCheckUtils]: 60: Hoare triple {5925#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5914#false} is VALID [2018-11-18 22:53:41,252 INFO L273 TraceCheckUtils]: 61: Hoare triple {5914#false} ~i~0 := 0; {5914#false} is VALID [2018-11-18 22:53:41,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,252 INFO L273 TraceCheckUtils]: 63: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,253 INFO L273 TraceCheckUtils]: 65: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,253 INFO L273 TraceCheckUtils]: 67: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,253 INFO L273 TraceCheckUtils]: 68: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,254 INFO L273 TraceCheckUtils]: 69: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,254 INFO L273 TraceCheckUtils]: 70: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,254 INFO L273 TraceCheckUtils]: 71: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,254 INFO L273 TraceCheckUtils]: 72: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,254 INFO L273 TraceCheckUtils]: 73: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 74: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 75: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 76: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 77: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 78: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 79: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,255 INFO L273 TraceCheckUtils]: 80: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 81: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 82: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 83: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 84: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 85: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 86: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 87: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,256 INFO L273 TraceCheckUtils]: 88: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 89: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 90: Hoare triple {5914#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 91: Hoare triple {5914#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 92: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 93: Hoare triple {5914#false} assume !(~i~0 < 100000); {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 94: Hoare triple {5914#false} havoc ~x~0;~x~0 := 0; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 95: Hoare triple {5914#false} assume true; {5914#false} is VALID [2018-11-18 22:53:41,257 INFO L273 TraceCheckUtils]: 96: Hoare triple {5914#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5914#false} is VALID [2018-11-18 22:53:41,258 INFO L256 TraceCheckUtils]: 97: Hoare triple {5914#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {5914#false} is VALID [2018-11-18 22:53:41,258 INFO L273 TraceCheckUtils]: 98: Hoare triple {5914#false} ~cond := #in~cond; {5914#false} is VALID [2018-11-18 22:53:41,258 INFO L273 TraceCheckUtils]: 99: Hoare triple {5914#false} assume 0 == ~cond; {5914#false} is VALID [2018-11-18 22:53:41,258 INFO L273 TraceCheckUtils]: 100: Hoare triple {5914#false} assume !false; {5914#false} is VALID [2018-11-18 22:53:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-11-18 22:53:41,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:41,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:53:41,282 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2018-11-18 22:53:41,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:41,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:53:41,357 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-18 22:53:41,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:53:41,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:53:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:53:41,358 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 14 states. [2018-11-18 22:53:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:41,990 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-11-18 22:53:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:53:41,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2018-11-18 22:53:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:53:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2018-11-18 22:53:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:53:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2018-11-18 22:53:41,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2018-11-18 22:53:42,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:42,490 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:53:42,490 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 22:53:42,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:53:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 22:53:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-18 22:53:42,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:42,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-18 22:53:42,552 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-18 22:53:42,552 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-18 22:53:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:42,555 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-11-18 22:53:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-18 22:53:42,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:42,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:42,556 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-18 22:53:42,556 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-18 22:53:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:42,558 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-11-18 22:53:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-18 22:53:42,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:42,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:42,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:42,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-18 22:53:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-11-18 22:53:42,562 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 101 [2018-11-18 22:53:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:42,562 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-11-18 22:53:42,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:53:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-18 22:53:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 22:53:42,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:42,563 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:42,564 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:42,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1679068228, now seen corresponding path program 11 times [2018-11-18 22:53:42,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:42,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:42,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:43,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {6880#true} call ULTIMATE.init(); {6880#true} is VALID [2018-11-18 22:53:43,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {6880#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6880#true} is VALID [2018-11-18 22:53:43,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:43,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6880#true} {6880#true} #80#return; {6880#true} is VALID [2018-11-18 22:53:43,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {6880#true} call #t~ret7 := main(); {6880#true} is VALID [2018-11-18 22:53:43,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {6880#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {6882#(= main_~i~0 0)} is VALID [2018-11-18 22:53:43,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {6882#(= main_~i~0 0)} assume true; {6882#(= main_~i~0 0)} is VALID [2018-11-18 22:53:43,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {6882#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6883#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:43,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {6883#(<= main_~i~0 1)} assume true; {6883#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:43,228 INFO L273 TraceCheckUtils]: 9: Hoare triple {6883#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6884#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:43,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {6884#(<= main_~i~0 2)} assume true; {6884#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:43,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {6884#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6885#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:43,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {6885#(<= main_~i~0 3)} assume true; {6885#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:43,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {6885#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6886#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:43,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {6886#(<= main_~i~0 4)} assume true; {6886#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:43,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {6886#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6887#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:43,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {6887#(<= main_~i~0 5)} assume true; {6887#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:43,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {6887#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6888#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:43,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {6888#(<= main_~i~0 6)} assume true; {6888#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:43,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {6888#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6889#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:43,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {6889#(<= main_~i~0 7)} assume true; {6889#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:43,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {6889#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6890#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:43,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {6890#(<= main_~i~0 8)} assume true; {6890#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:43,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {6890#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6891#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:43,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {6891#(<= main_~i~0 9)} assume true; {6891#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:43,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {6891#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6892#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:43,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {6892#(<= main_~i~0 10)} assume true; {6892#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:43,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {6892#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6893#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:43,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {6893#(<= main_~i~0 11)} assume true; {6893#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:43,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {6893#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6881#false} is VALID [2018-11-18 22:53:43,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {6881#false} ~i~0 := 0; {6881#false} is VALID [2018-11-18 22:53:43,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,243 INFO L273 TraceCheckUtils]: 37: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,244 INFO L273 TraceCheckUtils]: 40: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 49: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,245 INFO L273 TraceCheckUtils]: 50: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 55: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 56: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 57: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,246 INFO L273 TraceCheckUtils]: 58: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 60: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 63: Hoare triple {6881#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {6881#false} assume !(~i~0 < 100000); {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {6881#false} ~i~0 := 0; {6881#false} is VALID [2018-11-18 22:53:43,247 INFO L273 TraceCheckUtils]: 67: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 72: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 73: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,248 INFO L273 TraceCheckUtils]: 74: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 76: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 77: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 78: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 79: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 80: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 81: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,249 INFO L273 TraceCheckUtils]: 82: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 83: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 84: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 85: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 86: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 87: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 88: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 89: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,250 INFO L273 TraceCheckUtils]: 90: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 91: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 92: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 93: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 94: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 95: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 96: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 97: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 98: Hoare triple {6881#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6881#false} is VALID [2018-11-18 22:53:43,251 INFO L273 TraceCheckUtils]: 99: Hoare triple {6881#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 100: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 101: Hoare triple {6881#false} assume !(~i~0 < 100000); {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 102: Hoare triple {6881#false} havoc ~x~0;~x~0 := 0; {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 103: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 104: Hoare triple {6881#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L256 TraceCheckUtils]: 105: Hoare triple {6881#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 106: Hoare triple {6881#false} ~cond := #in~cond; {6881#false} is VALID [2018-11-18 22:53:43,252 INFO L273 TraceCheckUtils]: 107: Hoare triple {6881#false} assume 0 == ~cond; {6881#false} is VALID [2018-11-18 22:53:43,253 INFO L273 TraceCheckUtils]: 108: Hoare triple {6881#false} assume !false; {6881#false} is VALID [2018-11-18 22:53:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-11-18 22:53:43,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:43,258 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-18 22:53:43,266 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:53:45,167 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:53:45,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:53:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:45,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:53:45,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {6880#true} call ULTIMATE.init(); {6880#true} is VALID [2018-11-18 22:53:45,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {6880#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6880#true} is VALID [2018-11-18 22:53:45,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6880#true} {6880#true} #80#return; {6880#true} is VALID [2018-11-18 22:53:45,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {6880#true} call #t~ret7 := main(); {6880#true} is VALID [2018-11-18 22:53:45,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {6880#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {6880#true} is VALID [2018-11-18 22:53:45,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {6880#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 28: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {6880#true} assume !(~i~0 < 100000); {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {6880#true} ~i~0 := 0; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 31: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 39: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 40: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 48: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 49: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 50: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,343 INFO L273 TraceCheckUtils]: 51: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 52: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 53: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 54: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 55: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 56: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 57: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 58: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,344 INFO L273 TraceCheckUtils]: 59: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,345 INFO L273 TraceCheckUtils]: 60: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,345 INFO L273 TraceCheckUtils]: 61: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,345 INFO L273 TraceCheckUtils]: 62: Hoare triple {6880#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {6880#true} is VALID [2018-11-18 22:53:45,345 INFO L273 TraceCheckUtils]: 63: Hoare triple {6880#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6880#true} is VALID [2018-11-18 22:53:45,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {6880#true} assume true; {6880#true} is VALID [2018-11-18 22:53:45,345 INFO L273 TraceCheckUtils]: 65: Hoare triple {6880#true} assume !(~i~0 < 100000); {6880#true} is VALID [2018-11-18 22:53:45,346 INFO L273 TraceCheckUtils]: 66: Hoare triple {6880#true} ~i~0 := 0; {7095#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:45,346 INFO L273 TraceCheckUtils]: 67: Hoare triple {7095#(<= main_~i~0 0)} assume true; {7095#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:45,346 INFO L273 TraceCheckUtils]: 68: Hoare triple {7095#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7095#(<= main_~i~0 0)} is VALID [2018-11-18 22:53:45,347 INFO L273 TraceCheckUtils]: 69: Hoare triple {7095#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6883#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:45,347 INFO L273 TraceCheckUtils]: 70: Hoare triple {6883#(<= main_~i~0 1)} assume true; {6883#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:45,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {6883#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6883#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:45,348 INFO L273 TraceCheckUtils]: 72: Hoare triple {6883#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6884#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:45,348 INFO L273 TraceCheckUtils]: 73: Hoare triple {6884#(<= main_~i~0 2)} assume true; {6884#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:45,349 INFO L273 TraceCheckUtils]: 74: Hoare triple {6884#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6884#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:45,349 INFO L273 TraceCheckUtils]: 75: Hoare triple {6884#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6885#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:45,349 INFO L273 TraceCheckUtils]: 76: Hoare triple {6885#(<= main_~i~0 3)} assume true; {6885#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:45,350 INFO L273 TraceCheckUtils]: 77: Hoare triple {6885#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6885#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:45,350 INFO L273 TraceCheckUtils]: 78: Hoare triple {6885#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6886#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:45,351 INFO L273 TraceCheckUtils]: 79: Hoare triple {6886#(<= main_~i~0 4)} assume true; {6886#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:45,352 INFO L273 TraceCheckUtils]: 80: Hoare triple {6886#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6886#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:45,352 INFO L273 TraceCheckUtils]: 81: Hoare triple {6886#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6887#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:45,353 INFO L273 TraceCheckUtils]: 82: Hoare triple {6887#(<= main_~i~0 5)} assume true; {6887#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:45,354 INFO L273 TraceCheckUtils]: 83: Hoare triple {6887#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6887#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:45,354 INFO L273 TraceCheckUtils]: 84: Hoare triple {6887#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6888#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:45,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {6888#(<= main_~i~0 6)} assume true; {6888#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:45,356 INFO L273 TraceCheckUtils]: 86: Hoare triple {6888#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6888#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:45,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {6888#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6889#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:45,357 INFO L273 TraceCheckUtils]: 88: Hoare triple {6889#(<= main_~i~0 7)} assume true; {6889#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:45,357 INFO L273 TraceCheckUtils]: 89: Hoare triple {6889#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6889#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:45,358 INFO L273 TraceCheckUtils]: 90: Hoare triple {6889#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6890#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:45,359 INFO L273 TraceCheckUtils]: 91: Hoare triple {6890#(<= main_~i~0 8)} assume true; {6890#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:45,359 INFO L273 TraceCheckUtils]: 92: Hoare triple {6890#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6890#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:45,360 INFO L273 TraceCheckUtils]: 93: Hoare triple {6890#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6891#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:45,361 INFO L273 TraceCheckUtils]: 94: Hoare triple {6891#(<= main_~i~0 9)} assume true; {6891#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:45,361 INFO L273 TraceCheckUtils]: 95: Hoare triple {6891#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6891#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:45,362 INFO L273 TraceCheckUtils]: 96: Hoare triple {6891#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6892#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:45,363 INFO L273 TraceCheckUtils]: 97: Hoare triple {6892#(<= main_~i~0 10)} assume true; {6892#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:45,363 INFO L273 TraceCheckUtils]: 98: Hoare triple {6892#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6892#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:45,364 INFO L273 TraceCheckUtils]: 99: Hoare triple {6892#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6893#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:45,365 INFO L273 TraceCheckUtils]: 100: Hoare triple {6893#(<= main_~i~0 11)} assume true; {6893#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:45,365 INFO L273 TraceCheckUtils]: 101: Hoare triple {6893#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6881#false} is VALID [2018-11-18 22:53:45,366 INFO L273 TraceCheckUtils]: 102: Hoare triple {6881#false} havoc ~x~0;~x~0 := 0; {6881#false} is VALID [2018-11-18 22:53:45,366 INFO L273 TraceCheckUtils]: 103: Hoare triple {6881#false} assume true; {6881#false} is VALID [2018-11-18 22:53:45,366 INFO L273 TraceCheckUtils]: 104: Hoare triple {6881#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6881#false} is VALID [2018-11-18 22:53:45,366 INFO L256 TraceCheckUtils]: 105: Hoare triple {6881#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {6881#false} is VALID [2018-11-18 22:53:45,366 INFO L273 TraceCheckUtils]: 106: Hoare triple {6881#false} ~cond := #in~cond; {6881#false} is VALID [2018-11-18 22:53:45,367 INFO L273 TraceCheckUtils]: 107: Hoare triple {6881#false} assume 0 == ~cond; {6881#false} is VALID [2018-11-18 22:53:45,367 INFO L273 TraceCheckUtils]: 108: Hoare triple {6881#false} assume !false; {6881#false} is VALID [2018-11-18 22:53:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-18 22:53:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:53:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:53:45,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2018-11-18 22:53:45,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:53:45,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:53:45,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:45,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:53:45,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:53:45,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:53:45,489 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 15 states. [2018-11-18 22:53:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:45,962 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-18 22:53:45,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:53:45,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2018-11-18 22:53:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:53:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:53:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2018-11-18 22:53:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:53:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2018-11-18 22:53:45,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 152 transitions. [2018-11-18 22:53:46,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:53:46,582 INFO L225 Difference]: With dead ends: 208 [2018-11-18 22:53:46,583 INFO L226 Difference]: Without dead ends: 124 [2018-11-18 22:53:46,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 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-18 22:53:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-18 22:53:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-18 22:53:46,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:53:46,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-18 22:53:46,618 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-18 22:53:46,618 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-18 22:53:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:46,621 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-11-18 22:53:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-11-18 22:53:46,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:46,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:46,621 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-18 22:53:46,622 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-18 22:53:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:53:46,624 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-11-18 22:53:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-11-18 22:53:46,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:53:46,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:53:46,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:53:46,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:53:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:53:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-11-18 22:53:46,627 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 109 [2018-11-18 22:53:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:53:46,628 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-11-18 22:53:46,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:53:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-18 22:53:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 22:53:46,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:53:46,629 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:53:46,629 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:53:46,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:53:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash 566709785, now seen corresponding path program 12 times [2018-11-18 22:53:46,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:53:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:53:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:46,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:53:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:53:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:53:46,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {7918#true} call ULTIMATE.init(); {7918#true} is VALID [2018-11-18 22:53:46,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {7918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7918#true} is VALID [2018-11-18 22:53:46,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:53:46,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7918#true} {7918#true} #80#return; {7918#true} is VALID [2018-11-18 22:53:46,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {7918#true} call #t~ret7 := main(); {7918#true} is VALID [2018-11-18 22:53:46,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {7918#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {7920#(= main_~i~0 0)} is VALID [2018-11-18 22:53:46,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {7920#(= main_~i~0 0)} assume true; {7920#(= main_~i~0 0)} is VALID [2018-11-18 22:53:46,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {7920#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7921#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:46,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {7921#(<= main_~i~0 1)} assume true; {7921#(<= main_~i~0 1)} is VALID [2018-11-18 22:53:46,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {7921#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7922#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:46,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {7922#(<= main_~i~0 2)} assume true; {7922#(<= main_~i~0 2)} is VALID [2018-11-18 22:53:46,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {7922#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7923#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:46,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {7923#(<= main_~i~0 3)} assume true; {7923#(<= main_~i~0 3)} is VALID [2018-11-18 22:53:46,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {7923#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7924#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:46,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {7924#(<= main_~i~0 4)} assume true; {7924#(<= main_~i~0 4)} is VALID [2018-11-18 22:53:46,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {7924#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7925#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:46,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {7925#(<= main_~i~0 5)} assume true; {7925#(<= main_~i~0 5)} is VALID [2018-11-18 22:53:46,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {7925#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7926#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:46,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {7926#(<= main_~i~0 6)} assume true; {7926#(<= main_~i~0 6)} is VALID [2018-11-18 22:53:46,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {7926#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7927#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:46,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {7927#(<= main_~i~0 7)} assume true; {7927#(<= main_~i~0 7)} is VALID [2018-11-18 22:53:46,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {7927#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7928#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:46,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {7928#(<= main_~i~0 8)} assume true; {7928#(<= main_~i~0 8)} is VALID [2018-11-18 22:53:46,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {7928#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7929#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:46,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {7929#(<= main_~i~0 9)} assume true; {7929#(<= main_~i~0 9)} is VALID [2018-11-18 22:53:46,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {7929#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7930#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:46,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {7930#(<= main_~i~0 10)} assume true; {7930#(<= main_~i~0 10)} is VALID [2018-11-18 22:53:46,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {7930#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7931#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:46,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {7931#(<= main_~i~0 11)} assume true; {7931#(<= main_~i~0 11)} is VALID [2018-11-18 22:53:46,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {7931#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7932#(<= main_~i~0 12)} is VALID [2018-11-18 22:53:46,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {7932#(<= main_~i~0 12)} assume true; {7932#(<= main_~i~0 12)} is VALID [2018-11-18 22:53:46,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {7932#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7919#false} is VALID [2018-11-18 22:53:46,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {7919#false} ~i~0 := 0; {7919#false} is VALID [2018-11-18 22:53:46,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,986 INFO L273 TraceCheckUtils]: 37: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,987 INFO L273 TraceCheckUtils]: 39: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,988 INFO L273 TraceCheckUtils]: 44: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,988 INFO L273 TraceCheckUtils]: 45: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,991 INFO L273 TraceCheckUtils]: 61: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,992 INFO L273 TraceCheckUtils]: 62: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,992 INFO L273 TraceCheckUtils]: 63: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,992 INFO L273 TraceCheckUtils]: 67: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7919#false} is VALID [2018-11-18 22:53:46,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {7919#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7919#false} is VALID [2018-11-18 22:53:46,993 INFO L273 TraceCheckUtils]: 69: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,993 INFO L273 TraceCheckUtils]: 70: Hoare triple {7919#false} assume !(~i~0 < 100000); {7919#false} is VALID [2018-11-18 22:53:46,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {7919#false} ~i~0 := 0; {7919#false} is VALID [2018-11-18 22:53:46,993 INFO L273 TraceCheckUtils]: 72: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,993 INFO L273 TraceCheckUtils]: 73: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,994 INFO L273 TraceCheckUtils]: 74: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,994 INFO L273 TraceCheckUtils]: 75: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,994 INFO L273 TraceCheckUtils]: 76: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,994 INFO L273 TraceCheckUtils]: 77: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,994 INFO L273 TraceCheckUtils]: 78: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,994 INFO L273 TraceCheckUtils]: 79: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,995 INFO L273 TraceCheckUtils]: 80: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,995 INFO L273 TraceCheckUtils]: 81: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,995 INFO L273 TraceCheckUtils]: 82: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,995 INFO L273 TraceCheckUtils]: 83: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,995 INFO L273 TraceCheckUtils]: 84: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,995 INFO L273 TraceCheckUtils]: 85: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,996 INFO L273 TraceCheckUtils]: 86: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,996 INFO L273 TraceCheckUtils]: 87: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,996 INFO L273 TraceCheckUtils]: 88: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,996 INFO L273 TraceCheckUtils]: 89: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,996 INFO L273 TraceCheckUtils]: 90: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,996 INFO L273 TraceCheckUtils]: 91: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,997 INFO L273 TraceCheckUtils]: 92: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,997 INFO L273 TraceCheckUtils]: 93: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,997 INFO L273 TraceCheckUtils]: 94: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,997 INFO L273 TraceCheckUtils]: 95: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,997 INFO L273 TraceCheckUtils]: 96: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,997 INFO L273 TraceCheckUtils]: 97: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,998 INFO L273 TraceCheckUtils]: 98: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,998 INFO L273 TraceCheckUtils]: 99: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,998 INFO L273 TraceCheckUtils]: 100: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,998 INFO L273 TraceCheckUtils]: 101: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,998 INFO L273 TraceCheckUtils]: 102: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,998 INFO L273 TraceCheckUtils]: 103: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,999 INFO L273 TraceCheckUtils]: 104: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,999 INFO L273 TraceCheckUtils]: 105: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,999 INFO L273 TraceCheckUtils]: 106: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:53:46,999 INFO L273 TraceCheckUtils]: 107: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:53:46,999 INFO L273 TraceCheckUtils]: 108: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:46,999 INFO L273 TraceCheckUtils]: 109: Hoare triple {7919#false} assume !(~i~0 < 100000); {7919#false} is VALID [2018-11-18 22:53:47,000 INFO L273 TraceCheckUtils]: 110: Hoare triple {7919#false} havoc ~x~0;~x~0 := 0; {7919#false} is VALID [2018-11-18 22:53:47,000 INFO L273 TraceCheckUtils]: 111: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:53:47,000 INFO L273 TraceCheckUtils]: 112: Hoare triple {7919#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7919#false} is VALID [2018-11-18 22:53:47,000 INFO L256 TraceCheckUtils]: 113: Hoare triple {7919#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {7919#false} is VALID [2018-11-18 22:53:47,000 INFO L273 TraceCheckUtils]: 114: Hoare triple {7919#false} ~cond := #in~cond; {7919#false} is VALID [2018-11-18 22:53:47,000 INFO L273 TraceCheckUtils]: 115: Hoare triple {7919#false} assume 0 == ~cond; {7919#false} is VALID [2018-11-18 22:53:47,001 INFO L273 TraceCheckUtils]: 116: Hoare triple {7919#false} assume !false; {7919#false} is VALID [2018-11-18 22:53:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-18 22:53:47,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:53:47,009 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-18 22:53:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:54:11,440 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:54:11,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:11,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:11,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {7918#true} call ULTIMATE.init(); {7918#true} is VALID [2018-11-18 22:54:11,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {7918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7918#true} is VALID [2018-11-18 22:54:11,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7918#true} {7918#true} #80#return; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {7918#true} call #t~ret7 := main(); {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {7918#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {7918#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7918#true} is VALID [2018-11-18 22:54:11,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {7918#true} assume true; {7918#true} is VALID [2018-11-18 22:54:11,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {7918#true} assume !(~i~0 < 100000); {7918#true} is VALID [2018-11-18 22:54:11,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {7918#true} ~i~0 := 0; {8032#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:11,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {8032#(<= main_~i~0 0)} assume true; {8032#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:11,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {8032#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {8032#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:11,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {8032#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7921#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:11,908 INFO L273 TraceCheckUtils]: 36: Hoare triple {7921#(<= main_~i~0 1)} assume true; {7921#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:11,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {7921#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7921#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:11,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {7921#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7922#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:11,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {7922#(<= main_~i~0 2)} assume true; {7922#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:11,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {7922#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7922#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:11,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {7922#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7923#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:11,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {7923#(<= main_~i~0 3)} assume true; {7923#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:11,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {7923#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7923#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:11,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {7923#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7924#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:11,919 INFO L273 TraceCheckUtils]: 45: Hoare triple {7924#(<= main_~i~0 4)} assume true; {7924#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:11,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {7924#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7924#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:11,922 INFO L273 TraceCheckUtils]: 47: Hoare triple {7924#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7925#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:11,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {7925#(<= main_~i~0 5)} assume true; {7925#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:11,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {7925#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7925#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:11,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {7925#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7926#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:11,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {7926#(<= main_~i~0 6)} assume true; {7926#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:11,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {7926#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7926#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:11,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {7926#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7927#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:11,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {7927#(<= main_~i~0 7)} assume true; {7927#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:11,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {7927#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7927#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:11,929 INFO L273 TraceCheckUtils]: 56: Hoare triple {7927#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7928#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:11,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {7928#(<= main_~i~0 8)} assume true; {7928#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:11,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {7928#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7928#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:11,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {7928#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7929#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:11,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {7929#(<= main_~i~0 9)} assume true; {7929#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:11,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {7929#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7929#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:11,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {7929#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7930#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:11,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {7930#(<= main_~i~0 10)} assume true; {7930#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:11,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {7930#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7930#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:11,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {7930#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7931#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:11,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {7931#(<= main_~i~0 11)} assume true; {7931#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:11,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {7931#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {7931#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:11,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {7931#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7932#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:11,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {7932#(<= main_~i~0 12)} assume true; {7932#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:11,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {7932#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7919#false} is VALID [2018-11-18 22:54:11,939 INFO L273 TraceCheckUtils]: 71: Hoare triple {7919#false} ~i~0 := 0; {7919#false} is VALID [2018-11-18 22:54:11,939 INFO L273 TraceCheckUtils]: 72: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,940 INFO L273 TraceCheckUtils]: 74: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,940 INFO L273 TraceCheckUtils]: 75: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,940 INFO L273 TraceCheckUtils]: 76: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,940 INFO L273 TraceCheckUtils]: 77: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,940 INFO L273 TraceCheckUtils]: 78: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,941 INFO L273 TraceCheckUtils]: 79: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,941 INFO L273 TraceCheckUtils]: 80: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,941 INFO L273 TraceCheckUtils]: 81: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,941 INFO L273 TraceCheckUtils]: 82: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,941 INFO L273 TraceCheckUtils]: 83: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,942 INFO L273 TraceCheckUtils]: 84: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,942 INFO L273 TraceCheckUtils]: 85: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,942 INFO L273 TraceCheckUtils]: 86: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,942 INFO L273 TraceCheckUtils]: 87: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,942 INFO L273 TraceCheckUtils]: 88: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,943 INFO L273 TraceCheckUtils]: 89: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,943 INFO L273 TraceCheckUtils]: 90: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,943 INFO L273 TraceCheckUtils]: 91: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,943 INFO L273 TraceCheckUtils]: 92: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,943 INFO L273 TraceCheckUtils]: 93: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,944 INFO L273 TraceCheckUtils]: 94: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,944 INFO L273 TraceCheckUtils]: 95: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,944 INFO L273 TraceCheckUtils]: 96: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,944 INFO L273 TraceCheckUtils]: 97: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,944 INFO L273 TraceCheckUtils]: 98: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 99: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 100: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 101: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 102: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 103: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 104: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,945 INFO L273 TraceCheckUtils]: 105: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 106: Hoare triple {7919#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 107: Hoare triple {7919#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 108: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 109: Hoare triple {7919#false} assume !(~i~0 < 100000); {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 110: Hoare triple {7919#false} havoc ~x~0;~x~0 := 0; {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 111: Hoare triple {7919#false} assume true; {7919#false} is VALID [2018-11-18 22:54:11,946 INFO L273 TraceCheckUtils]: 112: Hoare triple {7919#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7919#false} is VALID [2018-11-18 22:54:11,947 INFO L256 TraceCheckUtils]: 113: Hoare triple {7919#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {7919#false} is VALID [2018-11-18 22:54:11,947 INFO L273 TraceCheckUtils]: 114: Hoare triple {7919#false} ~cond := #in~cond; {7919#false} is VALID [2018-11-18 22:54:11,947 INFO L273 TraceCheckUtils]: 115: Hoare triple {7919#false} assume 0 == ~cond; {7919#false} is VALID [2018-11-18 22:54:11,947 INFO L273 TraceCheckUtils]: 116: Hoare triple {7919#false} assume !false; {7919#false} is VALID [2018-11-18 22:54:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-18 22:54:11,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:11,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:54:11,979 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-11-18 22:54:11,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:11,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:54:12,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:12,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:54:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:54:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:54:12,065 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 16 states. [2018-11-18 22:54:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:12,590 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2018-11-18 22:54:12,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:54:12,591 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-11-18 22:54:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:54:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2018-11-18 22:54:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:54:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2018-11-18 22:54:12,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 160 transitions. [2018-11-18 22:54:12,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:12,766 INFO L225 Difference]: With dead ends: 222 [2018-11-18 22:54:12,766 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 22:54:12,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:54:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 22:54:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-18 22:54:12,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:12,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 130 states. [2018-11-18 22:54:12,830 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 130 states. [2018-11-18 22:54:12,830 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 130 states. [2018-11-18 22:54:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:12,833 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-18 22:54:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-18 22:54:12,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:12,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:12,833 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 132 states. [2018-11-18 22:54:12,834 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 132 states. [2018-11-18 22:54:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:12,836 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-18 22:54:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-18 22:54:12,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:12,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:12,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:12,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 22:54:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-11-18 22:54:12,839 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 117 [2018-11-18 22:54:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:12,840 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-11-18 22:54:12,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:54:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-11-18 22:54:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 22:54:12,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:12,841 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:12,842 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:12,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1191870000, now seen corresponding path program 13 times [2018-11-18 22:54:12,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:12,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:12,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:13,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {9027#true} call ULTIMATE.init(); {9027#true} is VALID [2018-11-18 22:54:13,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {9027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9027#true} is VALID [2018-11-18 22:54:13,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {9027#true} assume true; {9027#true} is VALID [2018-11-18 22:54:13,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9027#true} {9027#true} #80#return; {9027#true} is VALID [2018-11-18 22:54:13,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {9027#true} call #t~ret7 := main(); {9027#true} is VALID [2018-11-18 22:54:13,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {9027#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {9029#(= main_~i~0 0)} is VALID [2018-11-18 22:54:13,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {9029#(= main_~i~0 0)} assume true; {9029#(= main_~i~0 0)} is VALID [2018-11-18 22:54:13,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {9029#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9030#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:13,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {9030#(<= main_~i~0 1)} assume true; {9030#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:13,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {9030#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9031#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:13,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {9031#(<= main_~i~0 2)} assume true; {9031#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:13,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {9031#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9032#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:13,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {9032#(<= main_~i~0 3)} assume true; {9032#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:13,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {9032#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9033#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:13,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {9033#(<= main_~i~0 4)} assume true; {9033#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:13,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {9033#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9034#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:13,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {9034#(<= main_~i~0 5)} assume true; {9034#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:13,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {9034#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9035#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {9035#(<= main_~i~0 6)} assume true; {9035#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:13,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {9035#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9036#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {9036#(<= main_~i~0 7)} assume true; {9036#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:13,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {9036#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9037#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {9037#(<= main_~i~0 8)} assume true; {9037#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {9037#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9038#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {9038#(<= main_~i~0 9)} assume true; {9038#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:13,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {9038#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9039#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {9039#(<= main_~i~0 10)} assume true; {9039#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:13,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {9039#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9040#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:13,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {9040#(<= main_~i~0 11)} assume true; {9040#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {9040#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9041#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:13,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {9041#(<= main_~i~0 12)} assume true; {9041#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:13,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {9041#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9042#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 32: Hoare triple {9042#(<= main_~i~0 13)} assume true; {9042#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {9042#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9028#false} is VALID [2018-11-18 22:54:13,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {9028#false} ~i~0 := 0; {9028#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,746 INFO L273 TraceCheckUtils]: 45: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,746 INFO L273 TraceCheckUtils]: 48: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,746 INFO L273 TraceCheckUtils]: 49: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,747 INFO L273 TraceCheckUtils]: 51: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,747 INFO L273 TraceCheckUtils]: 52: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,747 INFO L273 TraceCheckUtils]: 54: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,747 INFO L273 TraceCheckUtils]: 55: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,748 INFO L273 TraceCheckUtils]: 56: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,748 INFO L273 TraceCheckUtils]: 57: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,748 INFO L273 TraceCheckUtils]: 58: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 65: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 66: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 67: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 68: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 71: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 72: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 74: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {9028#false} assume !(~i~0 < 100000); {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {9028#false} ~i~0 := 0; {9028#false} is VALID [2018-11-18 22:54:13,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 80: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 81: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 82: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 83: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 84: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 85: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,751 INFO L273 TraceCheckUtils]: 86: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 87: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 88: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 89: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 90: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 91: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 92: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 93: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,752 INFO L273 TraceCheckUtils]: 94: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 95: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 96: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 97: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 98: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 99: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 100: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 101: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 102: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,753 INFO L273 TraceCheckUtils]: 103: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 104: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 105: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 106: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 107: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 108: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 109: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 110: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,754 INFO L273 TraceCheckUtils]: 111: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 112: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 113: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 114: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 115: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 116: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 117: Hoare triple {9028#false} assume !(~i~0 < 100000); {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 118: Hoare triple {9028#false} havoc ~x~0;~x~0 := 0; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 119: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:13,755 INFO L273 TraceCheckUtils]: 120: Hoare triple {9028#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9028#false} is VALID [2018-11-18 22:54:13,756 INFO L256 TraceCheckUtils]: 121: Hoare triple {9028#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {9028#false} is VALID [2018-11-18 22:54:13,756 INFO L273 TraceCheckUtils]: 122: Hoare triple {9028#false} ~cond := #in~cond; {9028#false} is VALID [2018-11-18 22:54:13,756 INFO L273 TraceCheckUtils]: 123: Hoare triple {9028#false} assume 0 == ~cond; {9028#false} is VALID [2018-11-18 22:54:13,756 INFO L273 TraceCheckUtils]: 124: Hoare triple {9028#false} assume !false; {9028#false} is VALID [2018-11-18 22:54:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-11-18 22:54:13,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:13,763 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-18 22:54:13,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:13,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:14,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {9027#true} call ULTIMATE.init(); {9027#true} is VALID [2018-11-18 22:54:14,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {9027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9027#true} is VALID [2018-11-18 22:54:14,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {9027#true} assume true; {9027#true} is VALID [2018-11-18 22:54:14,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9027#true} {9027#true} #80#return; {9027#true} is VALID [2018-11-18 22:54:14,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {9027#true} call #t~ret7 := main(); {9027#true} is VALID [2018-11-18 22:54:14,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {9027#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {9061#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:14,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {9061#(<= main_~i~0 0)} assume true; {9061#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:14,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {9061#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9030#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:14,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {9030#(<= main_~i~0 1)} assume true; {9030#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:14,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {9030#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9031#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:14,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {9031#(<= main_~i~0 2)} assume true; {9031#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:14,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {9031#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9032#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:14,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {9032#(<= main_~i~0 3)} assume true; {9032#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:14,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {9032#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9033#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:14,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {9033#(<= main_~i~0 4)} assume true; {9033#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:14,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {9033#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9034#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:14,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {9034#(<= main_~i~0 5)} assume true; {9034#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:14,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {9034#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9035#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:14,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {9035#(<= main_~i~0 6)} assume true; {9035#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:14,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {9035#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9036#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:14,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {9036#(<= main_~i~0 7)} assume true; {9036#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:14,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {9036#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9037#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:14,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {9037#(<= main_~i~0 8)} assume true; {9037#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:14,091 INFO L273 TraceCheckUtils]: 23: Hoare triple {9037#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9038#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:14,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {9038#(<= main_~i~0 9)} assume true; {9038#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:14,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {9038#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9039#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:14,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {9039#(<= main_~i~0 10)} assume true; {9039#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:14,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {9039#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9040#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:14,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {9040#(<= main_~i~0 11)} assume true; {9040#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:14,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {9040#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9041#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:14,095 INFO L273 TraceCheckUtils]: 30: Hoare triple {9041#(<= main_~i~0 12)} assume true; {9041#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:14,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {9041#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9042#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:14,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {9042#(<= main_~i~0 13)} assume true; {9042#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:14,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {9042#(<= main_~i~0 13)} assume !(~i~0 < 100000); {9028#false} is VALID [2018-11-18 22:54:14,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {9028#false} ~i~0 := 0; {9028#false} is VALID [2018-11-18 22:54:14,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,099 INFO L273 TraceCheckUtils]: 42: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,100 INFO L273 TraceCheckUtils]: 46: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,101 INFO L273 TraceCheckUtils]: 52: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,101 INFO L273 TraceCheckUtils]: 53: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,101 INFO L273 TraceCheckUtils]: 54: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,101 INFO L273 TraceCheckUtils]: 55: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,102 INFO L273 TraceCheckUtils]: 56: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,102 INFO L273 TraceCheckUtils]: 57: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,102 INFO L273 TraceCheckUtils]: 60: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 61: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 63: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 64: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 65: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 66: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,103 INFO L273 TraceCheckUtils]: 67: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 68: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 69: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 70: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 71: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 72: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 73: Hoare triple {9028#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 74: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 75: Hoare triple {9028#false} assume !(~i~0 < 100000); {9028#false} is VALID [2018-11-18 22:54:14,104 INFO L273 TraceCheckUtils]: 76: Hoare triple {9028#false} ~i~0 := 0; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 77: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 78: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 79: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 81: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 82: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 83: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 84: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,105 INFO L273 TraceCheckUtils]: 85: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 86: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 87: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 88: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 89: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 90: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 91: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 92: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 93: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,106 INFO L273 TraceCheckUtils]: 94: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 95: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 96: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 97: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 98: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 99: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 100: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 101: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,107 INFO L273 TraceCheckUtils]: 102: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 103: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 104: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 105: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 106: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 107: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 108: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 109: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 110: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,108 INFO L273 TraceCheckUtils]: 111: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 112: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 113: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 114: Hoare triple {9028#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 115: Hoare triple {9028#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 116: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 117: Hoare triple {9028#false} assume !(~i~0 < 100000); {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 118: Hoare triple {9028#false} havoc ~x~0;~x~0 := 0; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 119: Hoare triple {9028#false} assume true; {9028#false} is VALID [2018-11-18 22:54:14,109 INFO L273 TraceCheckUtils]: 120: Hoare triple {9028#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9028#false} is VALID [2018-11-18 22:54:14,110 INFO L256 TraceCheckUtils]: 121: Hoare triple {9028#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {9028#false} is VALID [2018-11-18 22:54:14,110 INFO L273 TraceCheckUtils]: 122: Hoare triple {9028#false} ~cond := #in~cond; {9028#false} is VALID [2018-11-18 22:54:14,110 INFO L273 TraceCheckUtils]: 123: Hoare triple {9028#false} assume 0 == ~cond; {9028#false} is VALID [2018-11-18 22:54:14,110 INFO L273 TraceCheckUtils]: 124: Hoare triple {9028#false} assume !false; {9028#false} is VALID [2018-11-18 22:54:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-11-18 22:54:14,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:14,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:54:14,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2018-11-18 22:54:14,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:14,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:54:14,184 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-18 22:54:14,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:54:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:54:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:54:14,185 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 17 states. [2018-11-18 22:54:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:15,380 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2018-11-18 22:54:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:54:15,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2018-11-18 22:54:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:54:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2018-11-18 22:54:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:54:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2018-11-18 22:54:15,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions. [2018-11-18 22:54:15,589 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-18 22:54:15,592 INFO L225 Difference]: With dead ends: 236 [2018-11-18 22:54:15,592 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 22:54:15,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:54:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 22:54:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-18 22:54:15,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:15,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-18 22:54:15,634 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-18 22:54:15,634 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-18 22:54:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:15,637 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-11-18 22:54:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-11-18 22:54:15,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:15,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:15,638 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-18 22:54:15,638 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-18 22:54:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:15,641 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-11-18 22:54:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-11-18 22:54:15,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:15,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:15,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:15,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 22:54:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2018-11-18 22:54:15,644 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 125 [2018-11-18 22:54:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:15,645 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2018-11-18 22:54:15,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:54:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2018-11-18 22:54:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 22:54:15,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:15,647 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:15,647 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:15,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1535821075, now seen corresponding path program 14 times [2018-11-18 22:54:15,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:15,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:15,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:15,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:54:15,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:16,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {10207#true} call ULTIMATE.init(); {10207#true} is VALID [2018-11-18 22:54:16,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {10207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10207#true} is VALID [2018-11-18 22:54:16,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {10207#true} assume true; {10207#true} is VALID [2018-11-18 22:54:16,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10207#true} {10207#true} #80#return; {10207#true} is VALID [2018-11-18 22:54:16,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {10207#true} call #t~ret7 := main(); {10207#true} is VALID [2018-11-18 22:54:16,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {10207#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {10209#(= main_~i~0 0)} is VALID [2018-11-18 22:54:16,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {10209#(= main_~i~0 0)} assume true; {10209#(= main_~i~0 0)} is VALID [2018-11-18 22:54:16,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {10209#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10210#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:16,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {10210#(<= main_~i~0 1)} assume true; {10210#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:16,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {10210#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10211#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:16,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {10211#(<= main_~i~0 2)} assume true; {10211#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:16,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {10211#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10212#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:16,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {10212#(<= main_~i~0 3)} assume true; {10212#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:16,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {10212#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10213#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:16,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {10213#(<= main_~i~0 4)} assume true; {10213#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:16,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {10213#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10214#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:16,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {10214#(<= main_~i~0 5)} assume true; {10214#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:16,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {10214#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10215#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:16,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {10215#(<= main_~i~0 6)} assume true; {10215#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:16,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {10215#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10216#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:16,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {10216#(<= main_~i~0 7)} assume true; {10216#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:16,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {10216#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10217#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:16,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {10217#(<= main_~i~0 8)} assume true; {10217#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:16,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {10217#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10218#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:16,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {10218#(<= main_~i~0 9)} assume true; {10218#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:16,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {10218#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10219#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:16,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {10219#(<= main_~i~0 10)} assume true; {10219#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:16,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {10219#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10220#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:16,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {10220#(<= main_~i~0 11)} assume true; {10220#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:16,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {10220#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10221#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:16,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {10221#(<= main_~i~0 12)} assume true; {10221#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:16,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {10221#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10222#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:16,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {10222#(<= main_~i~0 13)} assume true; {10222#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:16,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {10222#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10223#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:16,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {10223#(<= main_~i~0 14)} assume true; {10223#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:16,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {10223#(<= main_~i~0 14)} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-18 22:54:16,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {10208#false} ~i~0 := 0; {10208#false} is VALID [2018-11-18 22:54:16,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,266 INFO L273 TraceCheckUtils]: 42: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,267 INFO L273 TraceCheckUtils]: 48: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,267 INFO L273 TraceCheckUtils]: 49: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,267 INFO L273 TraceCheckUtils]: 52: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,268 INFO L273 TraceCheckUtils]: 53: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,268 INFO L273 TraceCheckUtils]: 54: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,268 INFO L273 TraceCheckUtils]: 55: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,268 INFO L273 TraceCheckUtils]: 56: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,268 INFO L273 TraceCheckUtils]: 58: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 61: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 62: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 63: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 64: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 65: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 66: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,269 INFO L273 TraceCheckUtils]: 67: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 68: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 69: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 70: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 71: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 72: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 73: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 74: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,270 INFO L273 TraceCheckUtils]: 75: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 76: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 77: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 78: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 79: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 80: Hoare triple {10208#false} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 81: Hoare triple {10208#false} ~i~0 := 0; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 82: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 83: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,271 INFO L273 TraceCheckUtils]: 84: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 85: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 86: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 87: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 88: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 89: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 90: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 91: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,272 INFO L273 TraceCheckUtils]: 92: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 93: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 94: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 95: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 96: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 97: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 98: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 99: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 100: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,273 INFO L273 TraceCheckUtils]: 101: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 102: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 103: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 104: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 105: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 106: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 107: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 108: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 109: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,274 INFO L273 TraceCheckUtils]: 110: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 111: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 112: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 113: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 114: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 115: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 116: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 117: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,275 INFO L273 TraceCheckUtils]: 118: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 119: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 120: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 121: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 122: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 123: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 124: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 125: Hoare triple {10208#false} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 126: Hoare triple {10208#false} havoc ~x~0;~x~0 := 0; {10208#false} is VALID [2018-11-18 22:54:16,276 INFO L273 TraceCheckUtils]: 127: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,277 INFO L273 TraceCheckUtils]: 128: Hoare triple {10208#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10208#false} is VALID [2018-11-18 22:54:16,277 INFO L256 TraceCheckUtils]: 129: Hoare triple {10208#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {10208#false} is VALID [2018-11-18 22:54:16,277 INFO L273 TraceCheckUtils]: 130: Hoare triple {10208#false} ~cond := #in~cond; {10208#false} is VALID [2018-11-18 22:54:16,277 INFO L273 TraceCheckUtils]: 131: Hoare triple {10208#false} assume 0 == ~cond; {10208#false} is VALID [2018-11-18 22:54:16,277 INFO L273 TraceCheckUtils]: 132: Hoare triple {10208#false} assume !false; {10208#false} is VALID [2018-11-18 22:54:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2018-11-18 22:54:16,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:16,284 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-18 22:54:16,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:54:16,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:54:16,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:16,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:16,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {10207#true} call ULTIMATE.init(); {10207#true} is VALID [2018-11-18 22:54:16,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {10207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10207#true} is VALID [2018-11-18 22:54:16,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {10207#true} assume true; {10207#true} is VALID [2018-11-18 22:54:16,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10207#true} {10207#true} #80#return; {10207#true} is VALID [2018-11-18 22:54:16,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {10207#true} call #t~ret7 := main(); {10207#true} is VALID [2018-11-18 22:54:16,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {10207#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {10242#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:16,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {10242#(<= main_~i~0 0)} assume true; {10242#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:16,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {10242#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10210#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:16,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {10210#(<= main_~i~0 1)} assume true; {10210#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:16,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {10210#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10211#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:16,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {10211#(<= main_~i~0 2)} assume true; {10211#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:16,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {10211#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10212#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:16,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {10212#(<= main_~i~0 3)} assume true; {10212#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:16,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {10212#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10213#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:16,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {10213#(<= main_~i~0 4)} assume true; {10213#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:16,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {10213#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10214#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:16,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {10214#(<= main_~i~0 5)} assume true; {10214#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:16,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {10214#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10215#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:16,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {10215#(<= main_~i~0 6)} assume true; {10215#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:16,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {10215#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10216#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:16,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {10216#(<= main_~i~0 7)} assume true; {10216#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:16,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {10216#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10217#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:16,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {10217#(<= main_~i~0 8)} assume true; {10217#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:16,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {10217#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10218#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:16,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {10218#(<= main_~i~0 9)} assume true; {10218#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:16,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {10218#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10219#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:16,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {10219#(<= main_~i~0 10)} assume true; {10219#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:16,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {10219#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10220#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:16,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {10220#(<= main_~i~0 11)} assume true; {10220#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:16,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {10220#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10221#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:16,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {10221#(<= main_~i~0 12)} assume true; {10221#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:16,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {10221#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10222#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:16,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {10222#(<= main_~i~0 13)} assume true; {10222#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:16,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {10222#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10223#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:16,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {10223#(<= main_~i~0 14)} assume true; {10223#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:16,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {10223#(<= main_~i~0 14)} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-18 22:54:16,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {10208#false} ~i~0 := 0; {10208#false} is VALID [2018-11-18 22:54:16,566 INFO L273 TraceCheckUtils]: 37: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,566 INFO L273 TraceCheckUtils]: 40: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,567 INFO L273 TraceCheckUtils]: 46: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,568 INFO L273 TraceCheckUtils]: 48: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,568 INFO L273 TraceCheckUtils]: 50: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,569 INFO L273 TraceCheckUtils]: 54: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,569 INFO L273 TraceCheckUtils]: 55: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,569 INFO L273 TraceCheckUtils]: 56: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 60: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 61: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 62: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 63: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,570 INFO L273 TraceCheckUtils]: 64: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 66: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 67: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 68: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 69: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 70: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 71: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 72: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,571 INFO L273 TraceCheckUtils]: 73: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 74: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 75: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 76: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 77: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 78: Hoare triple {10208#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 79: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 80: Hoare triple {10208#false} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-18 22:54:16,572 INFO L273 TraceCheckUtils]: 81: Hoare triple {10208#false} ~i~0 := 0; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 82: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 83: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 84: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 85: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 86: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 87: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 88: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 89: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,573 INFO L273 TraceCheckUtils]: 90: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 91: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 92: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 93: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 94: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 95: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 96: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 97: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 98: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,574 INFO L273 TraceCheckUtils]: 99: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 100: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 101: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 102: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 103: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 104: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 105: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 106: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 107: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,575 INFO L273 TraceCheckUtils]: 108: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 109: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 110: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 111: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 112: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 113: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 114: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 115: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,576 INFO L273 TraceCheckUtils]: 116: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 117: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 118: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 119: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 120: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 121: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 122: Hoare triple {10208#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 123: Hoare triple {10208#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 124: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,577 INFO L273 TraceCheckUtils]: 125: Hoare triple {10208#false} assume !(~i~0 < 100000); {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L273 TraceCheckUtils]: 126: Hoare triple {10208#false} havoc ~x~0;~x~0 := 0; {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L273 TraceCheckUtils]: 127: Hoare triple {10208#false} assume true; {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L273 TraceCheckUtils]: 128: Hoare triple {10208#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L256 TraceCheckUtils]: 129: Hoare triple {10208#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L273 TraceCheckUtils]: 130: Hoare triple {10208#false} ~cond := #in~cond; {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L273 TraceCheckUtils]: 131: Hoare triple {10208#false} assume 0 == ~cond; {10208#false} is VALID [2018-11-18 22:54:16,578 INFO L273 TraceCheckUtils]: 132: Hoare triple {10208#false} assume !false; {10208#false} is VALID [2018-11-18 22:54:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2018-11-18 22:54:16,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:16,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:54:16,605 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-18 22:54:16,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:16,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:54:16,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:16,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:54:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:54:16,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:54:16,677 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 18 states. [2018-11-18 22:54:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:18,138 INFO L93 Difference]: Finished difference Result 250 states and 258 transitions. [2018-11-18 22:54:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:54:18,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-18 22:54:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:54:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 176 transitions. [2018-11-18 22:54:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:54:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 176 transitions. [2018-11-18 22:54:18,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 176 transitions. [2018-11-18 22:54:18,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:18,307 INFO L225 Difference]: With dead ends: 250 [2018-11-18 22:54:18,308 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 22:54:18,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:54:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 22:54:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-18 22:54:18,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:18,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-18 22:54:18,344 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-18 22:54:18,344 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-18 22:54:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:18,346 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-11-18 22:54:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-11-18 22:54:18,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:18,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:18,347 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-18 22:54:18,347 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-18 22:54:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:18,350 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-11-18 22:54:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-11-18 22:54:18,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:18,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:18,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:18,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 22:54:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2018-11-18 22:54:18,353 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 133 [2018-11-18 22:54:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2018-11-18 22:54:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:54:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2018-11-18 22:54:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 22:54:18,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:18,354 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:18,354 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:18,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -534937116, now seen corresponding path program 15 times [2018-11-18 22:54:18,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:18,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:18,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {11458#true} call ULTIMATE.init(); {11458#true} is VALID [2018-11-18 22:54:18,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {11458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11458#true} is VALID [2018-11-18 22:54:18,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {11458#true} assume true; {11458#true} is VALID [2018-11-18 22:54:18,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11458#true} {11458#true} #80#return; {11458#true} is VALID [2018-11-18 22:54:18,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {11458#true} call #t~ret7 := main(); {11458#true} is VALID [2018-11-18 22:54:18,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {11458#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {11460#(= main_~i~0 0)} is VALID [2018-11-18 22:54:18,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {11460#(= main_~i~0 0)} assume true; {11460#(= main_~i~0 0)} is VALID [2018-11-18 22:54:18,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {11460#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:18,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {11461#(<= main_~i~0 1)} assume true; {11461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:18,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {11461#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:18,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {11462#(<= main_~i~0 2)} assume true; {11462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:18,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {11462#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:18,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {11463#(<= main_~i~0 3)} assume true; {11463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:18,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {11463#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:18,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {11464#(<= main_~i~0 4)} assume true; {11464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:18,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {11464#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:18,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {11465#(<= main_~i~0 5)} assume true; {11465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:18,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {11465#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:18,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {11466#(<= main_~i~0 6)} assume true; {11466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:18,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {11466#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:18,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {11467#(<= main_~i~0 7)} assume true; {11467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:18,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {11467#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:18,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {11468#(<= main_~i~0 8)} assume true; {11468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:18,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {11468#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11469#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:18,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {11469#(<= main_~i~0 9)} assume true; {11469#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:18,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {11469#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11470#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:18,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {11470#(<= main_~i~0 10)} assume true; {11470#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:18,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {11470#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11471#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:18,899 INFO L273 TraceCheckUtils]: 28: Hoare triple {11471#(<= main_~i~0 11)} assume true; {11471#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:18,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {11471#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11472#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:18,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {11472#(<= main_~i~0 12)} assume true; {11472#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:18,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {11472#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11473#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:18,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {11473#(<= main_~i~0 13)} assume true; {11473#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:18,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {11473#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11474#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:18,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {11474#(<= main_~i~0 14)} assume true; {11474#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:18,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {11474#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11475#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:18,905 INFO L273 TraceCheckUtils]: 36: Hoare triple {11475#(<= main_~i~0 15)} assume true; {11475#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:18,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {11475#(<= main_~i~0 15)} assume !(~i~0 < 100000); {11459#false} is VALID [2018-11-18 22:54:18,906 INFO L273 TraceCheckUtils]: 38: Hoare triple {11459#false} ~i~0 := 0; {11459#false} is VALID [2018-11-18 22:54:18,906 INFO L273 TraceCheckUtils]: 39: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,908 INFO L273 TraceCheckUtils]: 45: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,910 INFO L273 TraceCheckUtils]: 55: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,910 INFO L273 TraceCheckUtils]: 57: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,910 INFO L273 TraceCheckUtils]: 58: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,910 INFO L273 TraceCheckUtils]: 59: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 60: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 62: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 64: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 65: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 67: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 68: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 69: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 70: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 71: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 72: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 73: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 74: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,912 INFO L273 TraceCheckUtils]: 75: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 76: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 77: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 78: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 79: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 80: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 81: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 82: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:18,913 INFO L273 TraceCheckUtils]: 83: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 84: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 85: Hoare triple {11459#false} assume !(~i~0 < 100000); {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 86: Hoare triple {11459#false} ~i~0 := 0; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 87: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 88: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 89: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 90: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 91: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,914 INFO L273 TraceCheckUtils]: 92: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 93: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 94: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 95: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 96: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 97: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 98: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 99: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 100: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,915 INFO L273 TraceCheckUtils]: 101: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 102: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 103: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 104: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 105: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 106: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 107: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 108: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,916 INFO L273 TraceCheckUtils]: 109: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 110: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 111: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 112: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 113: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 114: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 115: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 116: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 117: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,917 INFO L273 TraceCheckUtils]: 118: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 119: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 120: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 121: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 122: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 123: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 124: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 125: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 126: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,918 INFO L273 TraceCheckUtils]: 127: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 128: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 129: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 130: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 131: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 132: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 133: Hoare triple {11459#false} assume !(~i~0 < 100000); {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 134: Hoare triple {11459#false} havoc ~x~0;~x~0 := 0; {11459#false} is VALID [2018-11-18 22:54:18,919 INFO L273 TraceCheckUtils]: 135: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:18,920 INFO L273 TraceCheckUtils]: 136: Hoare triple {11459#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11459#false} is VALID [2018-11-18 22:54:18,920 INFO L256 TraceCheckUtils]: 137: Hoare triple {11459#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {11459#false} is VALID [2018-11-18 22:54:18,920 INFO L273 TraceCheckUtils]: 138: Hoare triple {11459#false} ~cond := #in~cond; {11459#false} is VALID [2018-11-18 22:54:18,920 INFO L273 TraceCheckUtils]: 139: Hoare triple {11459#false} assume 0 == ~cond; {11459#false} is VALID [2018-11-18 22:54:18,920 INFO L273 TraceCheckUtils]: 140: Hoare triple {11459#false} assume !false; {11459#false} is VALID [2018-11-18 22:54:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-11-18 22:54:18,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:18,928 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-18 22:54:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:54:50,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:54:50,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:50,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:51,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {11458#true} call ULTIMATE.init(); {11458#true} is VALID [2018-11-18 22:54:51,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {11458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11458#true} is VALID [2018-11-18 22:54:51,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {11458#true} assume true; {11458#true} is VALID [2018-11-18 22:54:51,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11458#true} {11458#true} #80#return; {11458#true} is VALID [2018-11-18 22:54:51,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {11458#true} call #t~ret7 := main(); {11458#true} is VALID [2018-11-18 22:54:51,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {11458#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {11494#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:51,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {11494#(<= main_~i~0 0)} assume true; {11494#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:51,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {11494#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:51,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {11461#(<= main_~i~0 1)} assume true; {11461#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:51,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {11461#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:51,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {11462#(<= main_~i~0 2)} assume true; {11462#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:51,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {11462#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:51,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {11463#(<= main_~i~0 3)} assume true; {11463#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:51,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {11463#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:51,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {11464#(<= main_~i~0 4)} assume true; {11464#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:51,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {11464#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:51,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {11465#(<= main_~i~0 5)} assume true; {11465#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:51,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {11465#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:51,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {11466#(<= main_~i~0 6)} assume true; {11466#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:51,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {11466#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:51,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {11467#(<= main_~i~0 7)} assume true; {11467#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:51,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {11467#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:51,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {11468#(<= main_~i~0 8)} assume true; {11468#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:51,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {11468#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11469#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:51,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {11469#(<= main_~i~0 9)} assume true; {11469#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:51,152 INFO L273 TraceCheckUtils]: 25: Hoare triple {11469#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11470#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:51,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {11470#(<= main_~i~0 10)} assume true; {11470#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:51,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {11470#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11471#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:51,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {11471#(<= main_~i~0 11)} assume true; {11471#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:51,155 INFO L273 TraceCheckUtils]: 29: Hoare triple {11471#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11472#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:51,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {11472#(<= main_~i~0 12)} assume true; {11472#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:51,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {11472#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11473#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:51,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {11473#(<= main_~i~0 13)} assume true; {11473#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:51,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {11473#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11474#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:51,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {11474#(<= main_~i~0 14)} assume true; {11474#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:51,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {11474#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11475#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:51,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {11475#(<= main_~i~0 15)} assume true; {11475#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:51,160 INFO L273 TraceCheckUtils]: 37: Hoare triple {11475#(<= main_~i~0 15)} assume !(~i~0 < 100000); {11459#false} is VALID [2018-11-18 22:54:51,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {11459#false} ~i~0 := 0; {11459#false} is VALID [2018-11-18 22:54:51,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,161 INFO L273 TraceCheckUtils]: 41: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,161 INFO L273 TraceCheckUtils]: 42: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,161 INFO L273 TraceCheckUtils]: 43: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,162 INFO L273 TraceCheckUtils]: 44: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,162 INFO L273 TraceCheckUtils]: 45: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,162 INFO L273 TraceCheckUtils]: 46: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,162 INFO L273 TraceCheckUtils]: 47: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,162 INFO L273 TraceCheckUtils]: 48: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,163 INFO L273 TraceCheckUtils]: 49: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,163 INFO L273 TraceCheckUtils]: 50: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,163 INFO L273 TraceCheckUtils]: 51: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,163 INFO L273 TraceCheckUtils]: 52: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,163 INFO L273 TraceCheckUtils]: 53: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 57: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 58: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 63: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 65: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 66: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 67: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 69: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 70: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 72: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 74: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 75: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 76: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,166 INFO L273 TraceCheckUtils]: 77: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 78: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 80: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 81: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 82: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 83: Hoare triple {11459#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 84: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 85: Hoare triple {11459#false} assume !(~i~0 < 100000); {11459#false} is VALID [2018-11-18 22:54:51,167 INFO L273 TraceCheckUtils]: 86: Hoare triple {11459#false} ~i~0 := 0; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 87: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 88: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 89: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 90: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 93: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 94: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,168 INFO L273 TraceCheckUtils]: 95: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 96: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 97: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 98: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 99: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 100: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 101: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 102: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,169 INFO L273 TraceCheckUtils]: 104: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 106: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 107: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 108: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 109: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 110: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 111: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,170 INFO L273 TraceCheckUtils]: 112: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 113: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 114: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 115: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 116: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 117: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 118: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 119: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 120: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,171 INFO L273 TraceCheckUtils]: 121: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 122: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 123: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 124: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 125: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 126: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 127: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 128: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 129: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,172 INFO L273 TraceCheckUtils]: 130: Hoare triple {11459#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 131: Hoare triple {11459#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 132: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 133: Hoare triple {11459#false} assume !(~i~0 < 100000); {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 134: Hoare triple {11459#false} havoc ~x~0;~x~0 := 0; {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 135: Hoare triple {11459#false} assume true; {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 136: Hoare triple {11459#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L256 TraceCheckUtils]: 137: Hoare triple {11459#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 138: Hoare triple {11459#false} ~cond := #in~cond; {11459#false} is VALID [2018-11-18 22:54:51,173 INFO L273 TraceCheckUtils]: 139: Hoare triple {11459#false} assume 0 == ~cond; {11459#false} is VALID [2018-11-18 22:54:51,174 INFO L273 TraceCheckUtils]: 140: Hoare triple {11459#false} assume !false; {11459#false} is VALID [2018-11-18 22:54:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-11-18 22:54:51,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:51,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:54:51,207 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 141 [2018-11-18 22:54:51,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:51,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:54:51,258 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-18 22:54:51,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:54:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:54:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:54:51,259 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 19 states. [2018-11-18 22:54:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:52,256 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2018-11-18 22:54:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:54:52,256 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 141 [2018-11-18 22:54:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:54:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 184 transitions. [2018-11-18 22:54:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:54:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 184 transitions. [2018-11-18 22:54:52,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 184 transitions. [2018-11-18 22:54:52,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:52,430 INFO L225 Difference]: With dead ends: 264 [2018-11-18 22:54:52,430 INFO L226 Difference]: Without dead ends: 156 [2018-11-18 22:54:52,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:54:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-18 22:54:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-11-18 22:54:52,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:52,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 154 states. [2018-11-18 22:54:52,471 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 154 states. [2018-11-18 22:54:52,471 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 154 states. [2018-11-18 22:54:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:52,474 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2018-11-18 22:54:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2018-11-18 22:54:52,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:52,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:52,475 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 156 states. [2018-11-18 22:54:52,476 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 156 states. [2018-11-18 22:54:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:52,478 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2018-11-18 22:54:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2018-11-18 22:54:52,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:52,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:52,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:52,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-18 22:54:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2018-11-18 22:54:52,482 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 141 [2018-11-18 22:54:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:52,482 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2018-11-18 22:54:52,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:54:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2018-11-18 22:54:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 22:54:52,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:52,484 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:52,484 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:52,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2037429823, now seen corresponding path program 16 times [2018-11-18 22:54:52,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:52,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:52,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:52,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:53,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {12780#true} call ULTIMATE.init(); {12780#true} is VALID [2018-11-18 22:54:53,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {12780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12780#true} is VALID [2018-11-18 22:54:53,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12780#true} {12780#true} #80#return; {12780#true} is VALID [2018-11-18 22:54:53,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {12780#true} call #t~ret7 := main(); {12780#true} is VALID [2018-11-18 22:54:53,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {12780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {12782#(= main_~i~0 0)} is VALID [2018-11-18 22:54:53,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {12782#(= main_~i~0 0)} assume true; {12782#(= main_~i~0 0)} is VALID [2018-11-18 22:54:53,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {12782#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12783#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:53,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {12783#(<= main_~i~0 1)} assume true; {12783#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:53,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {12783#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12784#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:53,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {12784#(<= main_~i~0 2)} assume true; {12784#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:53,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {12784#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12785#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:53,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {12785#(<= main_~i~0 3)} assume true; {12785#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:53,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {12785#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12786#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:53,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {12786#(<= main_~i~0 4)} assume true; {12786#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:53,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {12786#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12787#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:53,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {12787#(<= main_~i~0 5)} assume true; {12787#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:53,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {12787#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12788#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:53,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {12788#(<= main_~i~0 6)} assume true; {12788#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:53,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {12788#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12789#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:53,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {12789#(<= main_~i~0 7)} assume true; {12789#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:53,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {12789#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12790#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:53,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {12790#(<= main_~i~0 8)} assume true; {12790#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:53,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {12790#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12791#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:53,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {12791#(<= main_~i~0 9)} assume true; {12791#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:53,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {12791#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12792#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:53,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {12792#(<= main_~i~0 10)} assume true; {12792#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:53,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {12792#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12793#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:53,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {12793#(<= main_~i~0 11)} assume true; {12793#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:53,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {12793#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12794#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:53,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {12794#(<= main_~i~0 12)} assume true; {12794#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:53,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {12794#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12795#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:53,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {12795#(<= main_~i~0 13)} assume true; {12795#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:53,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {12795#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12796#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:53,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {12796#(<= main_~i~0 14)} assume true; {12796#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:53,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {12796#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12797#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:53,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {12797#(<= main_~i~0 15)} assume true; {12797#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:53,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {12797#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12798#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:53,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {12798#(<= main_~i~0 16)} assume true; {12798#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:53,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {12798#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12781#false} is VALID [2018-11-18 22:54:53,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {12781#false} ~i~0 := 0; {12781#false} is VALID [2018-11-18 22:54:53,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,255 INFO L273 TraceCheckUtils]: 43: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,255 INFO L273 TraceCheckUtils]: 44: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,255 INFO L273 TraceCheckUtils]: 45: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,255 INFO L273 TraceCheckUtils]: 47: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,256 INFO L273 TraceCheckUtils]: 49: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,256 INFO L273 TraceCheckUtils]: 50: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,256 INFO L273 TraceCheckUtils]: 51: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,256 INFO L273 TraceCheckUtils]: 52: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,257 INFO L273 TraceCheckUtils]: 53: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,257 INFO L273 TraceCheckUtils]: 54: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,257 INFO L273 TraceCheckUtils]: 55: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,257 INFO L273 TraceCheckUtils]: 56: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,257 INFO L273 TraceCheckUtils]: 57: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,258 INFO L273 TraceCheckUtils]: 58: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,258 INFO L273 TraceCheckUtils]: 59: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,258 INFO L273 TraceCheckUtils]: 60: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,259 INFO L273 TraceCheckUtils]: 61: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,259 INFO L273 TraceCheckUtils]: 62: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,259 INFO L273 TraceCheckUtils]: 63: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,259 INFO L273 TraceCheckUtils]: 64: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,259 INFO L273 TraceCheckUtils]: 65: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,260 INFO L273 TraceCheckUtils]: 66: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,260 INFO L273 TraceCheckUtils]: 68: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,260 INFO L273 TraceCheckUtils]: 69: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,260 INFO L273 TraceCheckUtils]: 70: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,260 INFO L273 TraceCheckUtils]: 71: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 72: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 73: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 74: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 75: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 76: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 77: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,261 INFO L273 TraceCheckUtils]: 78: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,262 INFO L273 TraceCheckUtils]: 79: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,262 INFO L273 TraceCheckUtils]: 80: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,262 INFO L273 TraceCheckUtils]: 81: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,262 INFO L273 TraceCheckUtils]: 82: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,262 INFO L273 TraceCheckUtils]: 83: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 86: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 87: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 88: Hoare triple {12781#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 89: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 90: Hoare triple {12781#false} assume !(~i~0 < 100000); {12781#false} is VALID [2018-11-18 22:54:53,263 INFO L273 TraceCheckUtils]: 91: Hoare triple {12781#false} ~i~0 := 0; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 92: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 93: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 94: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 95: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 96: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 97: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 98: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 99: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,264 INFO L273 TraceCheckUtils]: 100: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 101: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 102: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 103: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 104: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 105: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 106: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 107: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 108: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,265 INFO L273 TraceCheckUtils]: 109: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 110: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 111: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 112: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 113: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 114: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 115: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 116: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,266 INFO L273 TraceCheckUtils]: 117: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 118: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 119: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 120: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 121: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 122: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 123: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 124: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 125: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,267 INFO L273 TraceCheckUtils]: 126: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 127: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 128: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 129: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 130: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 131: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 132: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 133: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,268 INFO L273 TraceCheckUtils]: 134: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 135: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 136: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 137: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 138: Hoare triple {12781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 139: Hoare triple {12781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 140: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 141: Hoare triple {12781#false} assume !(~i~0 < 100000); {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 142: Hoare triple {12781#false} havoc ~x~0;~x~0 := 0; {12781#false} is VALID [2018-11-18 22:54:53,269 INFO L273 TraceCheckUtils]: 143: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,270 INFO L273 TraceCheckUtils]: 144: Hoare triple {12781#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12781#false} is VALID [2018-11-18 22:54:53,270 INFO L256 TraceCheckUtils]: 145: Hoare triple {12781#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {12781#false} is VALID [2018-11-18 22:54:53,270 INFO L273 TraceCheckUtils]: 146: Hoare triple {12781#false} ~cond := #in~cond; {12781#false} is VALID [2018-11-18 22:54:53,270 INFO L273 TraceCheckUtils]: 147: Hoare triple {12781#false} assume 0 == ~cond; {12781#false} is VALID [2018-11-18 22:54:53,270 INFO L273 TraceCheckUtils]: 148: Hoare triple {12781#false} assume !false; {12781#false} is VALID [2018-11-18 22:54:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-11-18 22:54:53,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:53,282 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-18 22:54:53,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:54:53,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:54:53,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:54:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:53,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:54:53,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {12780#true} call ULTIMATE.init(); {12780#true} is VALID [2018-11-18 22:54:53,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {12780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12780#true} is VALID [2018-11-18 22:54:53,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12780#true} {12780#true} #80#return; {12780#true} is VALID [2018-11-18 22:54:53,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {12780#true} call #t~ret7 := main(); {12780#true} is VALID [2018-11-18 22:54:53,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {12780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {12780#true} is VALID [2018-11-18 22:54:53,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,638 INFO L273 TraceCheckUtils]: 37: Hoare triple {12780#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12780#true} is VALID [2018-11-18 22:54:53,638 INFO L273 TraceCheckUtils]: 38: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,638 INFO L273 TraceCheckUtils]: 39: Hoare triple {12780#true} assume !(~i~0 < 100000); {12780#true} is VALID [2018-11-18 22:54:53,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {12780#true} ~i~0 := 0; {12780#true} is VALID [2018-11-18 22:54:53,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 44: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 45: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 46: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 47: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 49: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,639 INFO L273 TraceCheckUtils]: 50: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 51: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 52: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 53: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 54: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 56: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 57: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 58: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,640 INFO L273 TraceCheckUtils]: 59: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 60: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 61: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 62: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 63: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 64: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 65: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 66: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,641 INFO L273 TraceCheckUtils]: 67: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 68: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 71: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 72: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 73: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 74: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 75: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,642 INFO L273 TraceCheckUtils]: 76: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 77: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 78: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 79: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 80: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 81: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 82: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 83: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 84: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,643 INFO L273 TraceCheckUtils]: 85: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,644 INFO L273 TraceCheckUtils]: 86: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,644 INFO L273 TraceCheckUtils]: 87: Hoare triple {12780#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {12780#true} is VALID [2018-11-18 22:54:53,644 INFO L273 TraceCheckUtils]: 88: Hoare triple {12780#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12780#true} is VALID [2018-11-18 22:54:53,644 INFO L273 TraceCheckUtils]: 89: Hoare triple {12780#true} assume true; {12780#true} is VALID [2018-11-18 22:54:53,644 INFO L273 TraceCheckUtils]: 90: Hoare triple {12780#true} assume !(~i~0 < 100000); {12780#true} is VALID [2018-11-18 22:54:53,644 INFO L273 TraceCheckUtils]: 91: Hoare triple {12780#true} ~i~0 := 0; {13075#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:53,646 INFO L273 TraceCheckUtils]: 92: Hoare triple {13075#(<= main_~i~0 0)} assume true; {13075#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:53,646 INFO L273 TraceCheckUtils]: 93: Hoare triple {13075#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13075#(<= main_~i~0 0)} is VALID [2018-11-18 22:54:53,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {13075#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12783#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:53,648 INFO L273 TraceCheckUtils]: 95: Hoare triple {12783#(<= main_~i~0 1)} assume true; {12783#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:53,650 INFO L273 TraceCheckUtils]: 96: Hoare triple {12783#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12783#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:53,650 INFO L273 TraceCheckUtils]: 97: Hoare triple {12783#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12784#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:53,652 INFO L273 TraceCheckUtils]: 98: Hoare triple {12784#(<= main_~i~0 2)} assume true; {12784#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:53,652 INFO L273 TraceCheckUtils]: 99: Hoare triple {12784#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12784#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:53,654 INFO L273 TraceCheckUtils]: 100: Hoare triple {12784#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12785#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:53,654 INFO L273 TraceCheckUtils]: 101: Hoare triple {12785#(<= main_~i~0 3)} assume true; {12785#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:53,656 INFO L273 TraceCheckUtils]: 102: Hoare triple {12785#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12785#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:53,656 INFO L273 TraceCheckUtils]: 103: Hoare triple {12785#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12786#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:53,658 INFO L273 TraceCheckUtils]: 104: Hoare triple {12786#(<= main_~i~0 4)} assume true; {12786#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:53,658 INFO L273 TraceCheckUtils]: 105: Hoare triple {12786#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12786#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:53,658 INFO L273 TraceCheckUtils]: 106: Hoare triple {12786#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12787#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:53,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {12787#(<= main_~i~0 5)} assume true; {12787#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:53,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {12787#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12787#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:53,659 INFO L273 TraceCheckUtils]: 109: Hoare triple {12787#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12788#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:53,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {12788#(<= main_~i~0 6)} assume true; {12788#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:53,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {12788#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12788#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:53,660 INFO L273 TraceCheckUtils]: 112: Hoare triple {12788#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12789#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:53,661 INFO L273 TraceCheckUtils]: 113: Hoare triple {12789#(<= main_~i~0 7)} assume true; {12789#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:53,661 INFO L273 TraceCheckUtils]: 114: Hoare triple {12789#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12789#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:53,662 INFO L273 TraceCheckUtils]: 115: Hoare triple {12789#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12790#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:53,662 INFO L273 TraceCheckUtils]: 116: Hoare triple {12790#(<= main_~i~0 8)} assume true; {12790#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:53,662 INFO L273 TraceCheckUtils]: 117: Hoare triple {12790#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12790#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:53,663 INFO L273 TraceCheckUtils]: 118: Hoare triple {12790#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12791#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:53,664 INFO L273 TraceCheckUtils]: 119: Hoare triple {12791#(<= main_~i~0 9)} assume true; {12791#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:53,664 INFO L273 TraceCheckUtils]: 120: Hoare triple {12791#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12791#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:53,665 INFO L273 TraceCheckUtils]: 121: Hoare triple {12791#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12792#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:53,665 INFO L273 TraceCheckUtils]: 122: Hoare triple {12792#(<= main_~i~0 10)} assume true; {12792#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:53,666 INFO L273 TraceCheckUtils]: 123: Hoare triple {12792#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12792#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:53,666 INFO L273 TraceCheckUtils]: 124: Hoare triple {12792#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12793#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:53,667 INFO L273 TraceCheckUtils]: 125: Hoare triple {12793#(<= main_~i~0 11)} assume true; {12793#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:53,667 INFO L273 TraceCheckUtils]: 126: Hoare triple {12793#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12793#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:53,668 INFO L273 TraceCheckUtils]: 127: Hoare triple {12793#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12794#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:53,669 INFO L273 TraceCheckUtils]: 128: Hoare triple {12794#(<= main_~i~0 12)} assume true; {12794#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:53,669 INFO L273 TraceCheckUtils]: 129: Hoare triple {12794#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12794#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:53,670 INFO L273 TraceCheckUtils]: 130: Hoare triple {12794#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12795#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:53,670 INFO L273 TraceCheckUtils]: 131: Hoare triple {12795#(<= main_~i~0 13)} assume true; {12795#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:53,671 INFO L273 TraceCheckUtils]: 132: Hoare triple {12795#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12795#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:53,671 INFO L273 TraceCheckUtils]: 133: Hoare triple {12795#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12796#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:53,672 INFO L273 TraceCheckUtils]: 134: Hoare triple {12796#(<= main_~i~0 14)} assume true; {12796#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:53,672 INFO L273 TraceCheckUtils]: 135: Hoare triple {12796#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12796#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:53,673 INFO L273 TraceCheckUtils]: 136: Hoare triple {12796#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12797#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:53,674 INFO L273 TraceCheckUtils]: 137: Hoare triple {12797#(<= main_~i~0 15)} assume true; {12797#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:53,674 INFO L273 TraceCheckUtils]: 138: Hoare triple {12797#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12797#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:53,675 INFO L273 TraceCheckUtils]: 139: Hoare triple {12797#(<= main_~i~0 15)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12798#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:53,675 INFO L273 TraceCheckUtils]: 140: Hoare triple {12798#(<= main_~i~0 16)} assume true; {12798#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:53,676 INFO L273 TraceCheckUtils]: 141: Hoare triple {12798#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12781#false} is VALID [2018-11-18 22:54:53,676 INFO L273 TraceCheckUtils]: 142: Hoare triple {12781#false} havoc ~x~0;~x~0 := 0; {12781#false} is VALID [2018-11-18 22:54:53,676 INFO L273 TraceCheckUtils]: 143: Hoare triple {12781#false} assume true; {12781#false} is VALID [2018-11-18 22:54:53,677 INFO L273 TraceCheckUtils]: 144: Hoare triple {12781#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {12781#false} is VALID [2018-11-18 22:54:53,677 INFO L256 TraceCheckUtils]: 145: Hoare triple {12781#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {12781#false} is VALID [2018-11-18 22:54:53,677 INFO L273 TraceCheckUtils]: 146: Hoare triple {12781#false} ~cond := #in~cond; {12781#false} is VALID [2018-11-18 22:54:53,677 INFO L273 TraceCheckUtils]: 147: Hoare triple {12781#false} assume 0 == ~cond; {12781#false} is VALID [2018-11-18 22:54:53,677 INFO L273 TraceCheckUtils]: 148: Hoare triple {12781#false} assume !false; {12781#false} is VALID [2018-11-18 22:54:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2018-11-18 22:54:53,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:54:53,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:54:53,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 149 [2018-11-18 22:54:53,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:54:53,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:54:53,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:53,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:54:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:54:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:54:53,816 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand 20 states. [2018-11-18 22:54:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:54,494 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2018-11-18 22:54:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:54:54,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 149 [2018-11-18 22:54:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:54:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:54:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 192 transitions. [2018-11-18 22:54:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:54:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 192 transitions. [2018-11-18 22:54:54,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 192 transitions. [2018-11-18 22:54:54,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:54:54,669 INFO L225 Difference]: With dead ends: 278 [2018-11-18 22:54:54,669 INFO L226 Difference]: Without dead ends: 164 [2018-11-18 22:54:54,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 149 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-18 22:54:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-18 22:54:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-11-18 22:54:54,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:54:54,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 162 states. [2018-11-18 22:54:54,732 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 162 states. [2018-11-18 22:54:54,733 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 162 states. [2018-11-18 22:54:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:54,736 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2018-11-18 22:54:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2018-11-18 22:54:54,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:54,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:54,736 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 164 states. [2018-11-18 22:54:54,736 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 164 states. [2018-11-18 22:54:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:54:54,738 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2018-11-18 22:54:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2018-11-18 22:54:54,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:54:54,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:54:54,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:54:54,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:54:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-18 22:54:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 165 transitions. [2018-11-18 22:54:54,741 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 165 transitions. Word has length 149 [2018-11-18 22:54:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:54:54,741 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 165 transitions. [2018-11-18 22:54:54,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:54:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2018-11-18 22:54:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-18 22:54:54,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:54:54,742 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:54:54,742 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:54:54,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:54:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash -126454792, now seen corresponding path program 17 times [2018-11-18 22:54:54,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:54:54,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:54:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:54,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:54:54,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:54:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:54:55,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2018-11-18 22:54:55,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {14173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14173#true} is VALID [2018-11-18 22:54:55,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:54:55,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14173#true} {14173#true} #80#return; {14173#true} is VALID [2018-11-18 22:54:55,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {14173#true} call #t~ret7 := main(); {14173#true} is VALID [2018-11-18 22:54:55,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {14173#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {14175#(= main_~i~0 0)} is VALID [2018-11-18 22:54:55,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {14175#(= main_~i~0 0)} assume true; {14175#(= main_~i~0 0)} is VALID [2018-11-18 22:54:55,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {14175#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14176#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:55,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {14176#(<= main_~i~0 1)} assume true; {14176#(<= main_~i~0 1)} is VALID [2018-11-18 22:54:55,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {14176#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14177#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:55,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {14177#(<= main_~i~0 2)} assume true; {14177#(<= main_~i~0 2)} is VALID [2018-11-18 22:54:55,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {14177#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14178#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:55,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {14178#(<= main_~i~0 3)} assume true; {14178#(<= main_~i~0 3)} is VALID [2018-11-18 22:54:55,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {14178#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14179#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:55,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {14179#(<= main_~i~0 4)} assume true; {14179#(<= main_~i~0 4)} is VALID [2018-11-18 22:54:55,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {14179#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14180#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:55,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {14180#(<= main_~i~0 5)} assume true; {14180#(<= main_~i~0 5)} is VALID [2018-11-18 22:54:55,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {14180#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14181#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:55,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {14181#(<= main_~i~0 6)} assume true; {14181#(<= main_~i~0 6)} is VALID [2018-11-18 22:54:55,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {14181#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14182#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:55,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {14182#(<= main_~i~0 7)} assume true; {14182#(<= main_~i~0 7)} is VALID [2018-11-18 22:54:55,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {14182#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14183#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:55,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {14183#(<= main_~i~0 8)} assume true; {14183#(<= main_~i~0 8)} is VALID [2018-11-18 22:54:55,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {14183#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14184#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:55,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {14184#(<= main_~i~0 9)} assume true; {14184#(<= main_~i~0 9)} is VALID [2018-11-18 22:54:55,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {14184#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14185#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:55,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {14185#(<= main_~i~0 10)} assume true; {14185#(<= main_~i~0 10)} is VALID [2018-11-18 22:54:55,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {14185#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14186#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:55,719 INFO L273 TraceCheckUtils]: 28: Hoare triple {14186#(<= main_~i~0 11)} assume true; {14186#(<= main_~i~0 11)} is VALID [2018-11-18 22:54:55,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {14186#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14187#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:55,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {14187#(<= main_~i~0 12)} assume true; {14187#(<= main_~i~0 12)} is VALID [2018-11-18 22:54:55,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {14187#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14188#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:55,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {14188#(<= main_~i~0 13)} assume true; {14188#(<= main_~i~0 13)} is VALID [2018-11-18 22:54:55,723 INFO L273 TraceCheckUtils]: 33: Hoare triple {14188#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14189#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:55,723 INFO L273 TraceCheckUtils]: 34: Hoare triple {14189#(<= main_~i~0 14)} assume true; {14189#(<= main_~i~0 14)} is VALID [2018-11-18 22:54:55,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {14189#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14190#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:55,724 INFO L273 TraceCheckUtils]: 36: Hoare triple {14190#(<= main_~i~0 15)} assume true; {14190#(<= main_~i~0 15)} is VALID [2018-11-18 22:54:55,725 INFO L273 TraceCheckUtils]: 37: Hoare triple {14190#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14191#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:55,726 INFO L273 TraceCheckUtils]: 38: Hoare triple {14191#(<= main_~i~0 16)} assume true; {14191#(<= main_~i~0 16)} is VALID [2018-11-18 22:54:55,727 INFO L273 TraceCheckUtils]: 39: Hoare triple {14191#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14192#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:55,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {14192#(<= main_~i~0 17)} assume true; {14192#(<= main_~i~0 17)} is VALID [2018-11-18 22:54:55,728 INFO L273 TraceCheckUtils]: 41: Hoare triple {14192#(<= main_~i~0 17)} assume !(~i~0 < 100000); {14174#false} is VALID [2018-11-18 22:54:55,728 INFO L273 TraceCheckUtils]: 42: Hoare triple {14174#false} ~i~0 := 0; {14174#false} is VALID [2018-11-18 22:54:55,728 INFO L273 TraceCheckUtils]: 43: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,728 INFO L273 TraceCheckUtils]: 44: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,729 INFO L273 TraceCheckUtils]: 45: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,729 INFO L273 TraceCheckUtils]: 46: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,729 INFO L273 TraceCheckUtils]: 49: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,729 INFO L273 TraceCheckUtils]: 50: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,730 INFO L273 TraceCheckUtils]: 51: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,730 INFO L273 TraceCheckUtils]: 52: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,730 INFO L273 TraceCheckUtils]: 53: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,730 INFO L273 TraceCheckUtils]: 54: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 56: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 57: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 59: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 60: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 61: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 62: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,731 INFO L273 TraceCheckUtils]: 63: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 65: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 66: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 67: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 68: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 69: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 70: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 71: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,732 INFO L273 TraceCheckUtils]: 72: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 73: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 74: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 75: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 76: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 77: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 78: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,733 INFO L273 TraceCheckUtils]: 80: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 82: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 84: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 85: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 86: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 87: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 88: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,734 INFO L273 TraceCheckUtils]: 89: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 90: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 91: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 92: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 93: Hoare triple {14174#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 94: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 95: Hoare triple {14174#false} assume !(~i~0 < 100000); {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 96: Hoare triple {14174#false} ~i~0 := 0; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 97: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,735 INFO L273 TraceCheckUtils]: 98: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 99: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 100: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 101: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 102: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 103: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 104: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 105: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 106: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,736 INFO L273 TraceCheckUtils]: 107: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 108: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 109: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 110: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 111: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 112: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 113: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 114: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 115: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,737 INFO L273 TraceCheckUtils]: 116: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 117: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 118: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 119: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 120: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 121: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 122: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 123: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 124: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,738 INFO L273 TraceCheckUtils]: 125: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 126: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 127: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 128: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 129: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 130: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 131: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 132: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,739 INFO L273 TraceCheckUtils]: 133: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 134: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 135: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 136: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 137: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 138: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 139: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 140: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 141: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,740 INFO L273 TraceCheckUtils]: 142: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 143: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 144: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 145: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 146: Hoare triple {14174#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 147: Hoare triple {14174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 148: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 149: Hoare triple {14174#false} assume !(~i~0 < 100000); {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 150: Hoare triple {14174#false} havoc ~x~0;~x~0 := 0; {14174#false} is VALID [2018-11-18 22:54:55,741 INFO L273 TraceCheckUtils]: 151: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:54:55,742 INFO L273 TraceCheckUtils]: 152: Hoare triple {14174#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14174#false} is VALID [2018-11-18 22:54:55,742 INFO L256 TraceCheckUtils]: 153: Hoare triple {14174#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {14174#false} is VALID [2018-11-18 22:54:55,742 INFO L273 TraceCheckUtils]: 154: Hoare triple {14174#false} ~cond := #in~cond; {14174#false} is VALID [2018-11-18 22:54:55,742 INFO L273 TraceCheckUtils]: 155: Hoare triple {14174#false} assume 0 == ~cond; {14174#false} is VALID [2018-11-18 22:54:55,742 INFO L273 TraceCheckUtils]: 156: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2018-11-18 22:54:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-11-18 22:54:55,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:54:55,752 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-18 22:54:55,763 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:43,291 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:56:43,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:43,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:43,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2018-11-18 22:56:43,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {14173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14173#true} is VALID [2018-11-18 22:56:43,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14173#true} {14173#true} #80#return; {14173#true} is VALID [2018-11-18 22:56:43,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {14173#true} call #t~ret7 := main(); {14173#true} is VALID [2018-11-18 22:56:43,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {14173#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {14173#true} is VALID [2018-11-18 22:56:43,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,620 INFO L273 TraceCheckUtils]: 31: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {14173#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14173#true} is VALID [2018-11-18 22:56:43,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {14173#true} assume !(~i~0 < 100000); {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {14173#true} ~i~0 := 0; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 48: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,623 INFO L273 TraceCheckUtils]: 57: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 61: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 63: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 64: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 65: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,624 INFO L273 TraceCheckUtils]: 66: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 70: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 71: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 72: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 73: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 74: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,625 INFO L273 TraceCheckUtils]: 75: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 76: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 77: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 78: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 79: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 82: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 83: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,626 INFO L273 TraceCheckUtils]: 84: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 85: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 86: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 87: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 88: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 89: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 90: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 91: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 92: Hoare triple {14173#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {14173#true} is VALID [2018-11-18 22:56:43,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {14173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14173#true} is VALID [2018-11-18 22:56:43,628 INFO L273 TraceCheckUtils]: 94: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-18 22:56:43,628 INFO L273 TraceCheckUtils]: 95: Hoare triple {14173#true} assume !(~i~0 < 100000); {14173#true} is VALID [2018-11-18 22:56:43,628 INFO L273 TraceCheckUtils]: 96: Hoare triple {14173#true} ~i~0 := 0; {14484#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,628 INFO L273 TraceCheckUtils]: 97: Hoare triple {14484#(<= main_~i~0 0)} assume true; {14484#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,629 INFO L273 TraceCheckUtils]: 98: Hoare triple {14484#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14484#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,629 INFO L273 TraceCheckUtils]: 99: Hoare triple {14484#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14176#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {14176#(<= main_~i~0 1)} assume true; {14176#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,630 INFO L273 TraceCheckUtils]: 101: Hoare triple {14176#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14176#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,630 INFO L273 TraceCheckUtils]: 102: Hoare triple {14176#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14177#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,631 INFO L273 TraceCheckUtils]: 103: Hoare triple {14177#(<= main_~i~0 2)} assume true; {14177#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,631 INFO L273 TraceCheckUtils]: 104: Hoare triple {14177#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14177#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,632 INFO L273 TraceCheckUtils]: 105: Hoare triple {14177#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14178#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,632 INFO L273 TraceCheckUtils]: 106: Hoare triple {14178#(<= main_~i~0 3)} assume true; {14178#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,633 INFO L273 TraceCheckUtils]: 107: Hoare triple {14178#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14178#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,633 INFO L273 TraceCheckUtils]: 108: Hoare triple {14178#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14179#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,634 INFO L273 TraceCheckUtils]: 109: Hoare triple {14179#(<= main_~i~0 4)} assume true; {14179#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,634 INFO L273 TraceCheckUtils]: 110: Hoare triple {14179#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14179#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,635 INFO L273 TraceCheckUtils]: 111: Hoare triple {14179#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14180#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,636 INFO L273 TraceCheckUtils]: 112: Hoare triple {14180#(<= main_~i~0 5)} assume true; {14180#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {14180#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14180#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:43,637 INFO L273 TraceCheckUtils]: 114: Hoare triple {14180#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14181#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,637 INFO L273 TraceCheckUtils]: 115: Hoare triple {14181#(<= main_~i~0 6)} assume true; {14181#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,638 INFO L273 TraceCheckUtils]: 116: Hoare triple {14181#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14181#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:43,639 INFO L273 TraceCheckUtils]: 117: Hoare triple {14181#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14182#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,639 INFO L273 TraceCheckUtils]: 118: Hoare triple {14182#(<= main_~i~0 7)} assume true; {14182#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,640 INFO L273 TraceCheckUtils]: 119: Hoare triple {14182#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14182#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:43,641 INFO L273 TraceCheckUtils]: 120: Hoare triple {14182#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14183#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,641 INFO L273 TraceCheckUtils]: 121: Hoare triple {14183#(<= main_~i~0 8)} assume true; {14183#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,642 INFO L273 TraceCheckUtils]: 122: Hoare triple {14183#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14183#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:43,642 INFO L273 TraceCheckUtils]: 123: Hoare triple {14183#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14184#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,643 INFO L273 TraceCheckUtils]: 124: Hoare triple {14184#(<= main_~i~0 9)} assume true; {14184#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,643 INFO L273 TraceCheckUtils]: 125: Hoare triple {14184#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14184#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:43,644 INFO L273 TraceCheckUtils]: 126: Hoare triple {14184#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14185#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,645 INFO L273 TraceCheckUtils]: 127: Hoare triple {14185#(<= main_~i~0 10)} assume true; {14185#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,645 INFO L273 TraceCheckUtils]: 128: Hoare triple {14185#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14185#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:43,646 INFO L273 TraceCheckUtils]: 129: Hoare triple {14185#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14186#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,646 INFO L273 TraceCheckUtils]: 130: Hoare triple {14186#(<= main_~i~0 11)} assume true; {14186#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,647 INFO L273 TraceCheckUtils]: 131: Hoare triple {14186#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14186#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:43,648 INFO L273 TraceCheckUtils]: 132: Hoare triple {14186#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14187#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,648 INFO L273 TraceCheckUtils]: 133: Hoare triple {14187#(<= main_~i~0 12)} assume true; {14187#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,649 INFO L273 TraceCheckUtils]: 134: Hoare triple {14187#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14187#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:43,649 INFO L273 TraceCheckUtils]: 135: Hoare triple {14187#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14188#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,650 INFO L273 TraceCheckUtils]: 136: Hoare triple {14188#(<= main_~i~0 13)} assume true; {14188#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,650 INFO L273 TraceCheckUtils]: 137: Hoare triple {14188#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14188#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:43,651 INFO L273 TraceCheckUtils]: 138: Hoare triple {14188#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14189#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,652 INFO L273 TraceCheckUtils]: 139: Hoare triple {14189#(<= main_~i~0 14)} assume true; {14189#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,652 INFO L273 TraceCheckUtils]: 140: Hoare triple {14189#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14189#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:43,653 INFO L273 TraceCheckUtils]: 141: Hoare triple {14189#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14190#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,653 INFO L273 TraceCheckUtils]: 142: Hoare triple {14190#(<= main_~i~0 15)} assume true; {14190#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,654 INFO L273 TraceCheckUtils]: 143: Hoare triple {14190#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14190#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:43,655 INFO L273 TraceCheckUtils]: 144: Hoare triple {14190#(<= main_~i~0 15)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14191#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:43,655 INFO L273 TraceCheckUtils]: 145: Hoare triple {14191#(<= main_~i~0 16)} assume true; {14191#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:43,656 INFO L273 TraceCheckUtils]: 146: Hoare triple {14191#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14191#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:43,656 INFO L273 TraceCheckUtils]: 147: Hoare triple {14191#(<= main_~i~0 16)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14192#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:43,657 INFO L273 TraceCheckUtils]: 148: Hoare triple {14192#(<= main_~i~0 17)} assume true; {14192#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:43,658 INFO L273 TraceCheckUtils]: 149: Hoare triple {14192#(<= main_~i~0 17)} assume !(~i~0 < 100000); {14174#false} is VALID [2018-11-18 22:56:43,658 INFO L273 TraceCheckUtils]: 150: Hoare triple {14174#false} havoc ~x~0;~x~0 := 0; {14174#false} is VALID [2018-11-18 22:56:43,658 INFO L273 TraceCheckUtils]: 151: Hoare triple {14174#false} assume true; {14174#false} is VALID [2018-11-18 22:56:43,658 INFO L273 TraceCheckUtils]: 152: Hoare triple {14174#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {14174#false} is VALID [2018-11-18 22:56:43,658 INFO L256 TraceCheckUtils]: 153: Hoare triple {14174#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {14174#false} is VALID [2018-11-18 22:56:43,659 INFO L273 TraceCheckUtils]: 154: Hoare triple {14174#false} ~cond := #in~cond; {14174#false} is VALID [2018-11-18 22:56:43,659 INFO L273 TraceCheckUtils]: 155: Hoare triple {14174#false} assume 0 == ~cond; {14174#false} is VALID [2018-11-18 22:56:43,659 INFO L273 TraceCheckUtils]: 156: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2018-11-18 22:56:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-11-18 22:56:43,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:43,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:56:43,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 157 [2018-11-18 22:56:43,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:43,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:56:43,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:43,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:56:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:56:43,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:56:43,858 INFO L87 Difference]: Start difference. First operand 162 states and 165 transitions. Second operand 21 states. [2018-11-18 22:56:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:44,514 INFO L93 Difference]: Finished difference Result 292 states and 300 transitions. [2018-11-18 22:56:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:56:44,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 157 [2018-11-18 22:56:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:56:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 200 transitions. [2018-11-18 22:56:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:56:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 200 transitions. [2018-11-18 22:56:44,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 200 transitions. [2018-11-18 22:56:44,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:44,926 INFO L225 Difference]: With dead ends: 292 [2018-11-18 22:56:44,926 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 22:56:44,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:56:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 22:56:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-18 22:56:45,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:45,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 170 states. [2018-11-18 22:56:45,013 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 170 states. [2018-11-18 22:56:45,013 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 170 states. [2018-11-18 22:56:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,016 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-11-18 22:56:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2018-11-18 22:56:45,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:45,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:45,016 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 172 states. [2018-11-18 22:56:45,017 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 172 states. [2018-11-18 22:56:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,019 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-11-18 22:56:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2018-11-18 22:56:45,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:45,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:45,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:45,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 22:56:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 173 transitions. [2018-11-18 22:56:45,023 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 173 transitions. Word has length 157 [2018-11-18 22:56:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:45,024 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 173 transitions. [2018-11-18 22:56:45,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:56:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 173 transitions. [2018-11-18 22:56:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 22:56:45,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:45,025 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:45,026 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:45,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2023458155, now seen corresponding path program 18 times [2018-11-18 22:56:45,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:45,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:45,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:45,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:45,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:45,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {15637#true} call ULTIMATE.init(); {15637#true} is VALID [2018-11-18 22:56:45,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {15637#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15637#true} is VALID [2018-11-18 22:56:45,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {15637#true} assume true; {15637#true} is VALID [2018-11-18 22:56:45,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15637#true} {15637#true} #80#return; {15637#true} is VALID [2018-11-18 22:56:45,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {15637#true} call #t~ret7 := main(); {15637#true} is VALID [2018-11-18 22:56:45,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {15637#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {15639#(= main_~i~0 0)} is VALID [2018-11-18 22:56:45,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {15639#(= main_~i~0 0)} assume true; {15639#(= main_~i~0 0)} is VALID [2018-11-18 22:56:45,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {15639#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15640#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {15640#(<= main_~i~0 1)} assume true; {15640#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {15640#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15641#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {15641#(<= main_~i~0 2)} assume true; {15641#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {15641#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15642#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {15642#(<= main_~i~0 3)} assume true; {15642#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {15642#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15643#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {15643#(<= main_~i~0 4)} assume true; {15643#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {15643#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15644#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {15644#(<= main_~i~0 5)} assume true; {15644#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {15644#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15645#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {15645#(<= main_~i~0 6)} assume true; {15645#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {15645#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15646#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:45,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {15646#(<= main_~i~0 7)} assume true; {15646#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:45,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {15646#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15647#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:45,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {15647#(<= main_~i~0 8)} assume true; {15647#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:45,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {15647#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15648#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:45,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {15648#(<= main_~i~0 9)} assume true; {15648#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:45,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {15648#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15649#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:45,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {15649#(<= main_~i~0 10)} assume true; {15649#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:45,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {15649#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15650#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:45,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {15650#(<= main_~i~0 11)} assume true; {15650#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:45,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {15650#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15651#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:45,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {15651#(<= main_~i~0 12)} assume true; {15651#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:45,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {15651#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15652#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:45,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {15652#(<= main_~i~0 13)} assume true; {15652#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:45,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {15652#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15653#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:45,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {15653#(<= main_~i~0 14)} assume true; {15653#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:45,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {15653#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15654#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:45,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {15654#(<= main_~i~0 15)} assume true; {15654#(<= main_~i~0 15)} is VALID [2018-11-18 22:56:45,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {15654#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15655#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:45,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {15655#(<= main_~i~0 16)} assume true; {15655#(<= main_~i~0 16)} is VALID [2018-11-18 22:56:45,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {15655#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15656#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:45,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {15656#(<= main_~i~0 17)} assume true; {15656#(<= main_~i~0 17)} is VALID [2018-11-18 22:56:45,593 INFO L273 TraceCheckUtils]: 41: Hoare triple {15656#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15657#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:45,594 INFO L273 TraceCheckUtils]: 42: Hoare triple {15657#(<= main_~i~0 18)} assume true; {15657#(<= main_~i~0 18)} is VALID [2018-11-18 22:56:45,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {15657#(<= main_~i~0 18)} assume !(~i~0 < 100000); {15638#false} is VALID [2018-11-18 22:56:45,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {15638#false} ~i~0 := 0; {15638#false} is VALID [2018-11-18 22:56:45,595 INFO L273 TraceCheckUtils]: 45: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,595 INFO L273 TraceCheckUtils]: 46: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,595 INFO L273 TraceCheckUtils]: 47: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 49: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 50: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,597 INFO L273 TraceCheckUtils]: 54: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,597 INFO L273 TraceCheckUtils]: 55: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,597 INFO L273 TraceCheckUtils]: 56: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,597 INFO L273 TraceCheckUtils]: 57: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 58: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 59: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 60: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 61: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 62: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 63: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,599 INFO L273 TraceCheckUtils]: 65: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,599 INFO L273 TraceCheckUtils]: 66: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,599 INFO L273 TraceCheckUtils]: 67: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,599 INFO L273 TraceCheckUtils]: 68: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 69: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 70: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 71: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 72: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 73: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 74: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 75: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 76: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 77: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 78: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 79: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 80: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 81: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 82: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 83: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 84: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 85: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 86: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 87: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 88: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 89: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 90: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 91: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 92: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 93: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 94: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 95: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 96: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 97: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem2, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem2; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 98: Hoare triple {15638#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 99: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 100: Hoare triple {15638#false} assume !(~i~0 < 100000); {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 101: Hoare triple {15638#false} ~i~0 := 0; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 102: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 103: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 104: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 105: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 106: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 107: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 108: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 109: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 110: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 111: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 112: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 113: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 114: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 115: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 116: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 117: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 118: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 119: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 120: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 121: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 122: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 123: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 124: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 125: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 126: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 127: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 128: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 129: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 130: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 131: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 132: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 133: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 134: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 135: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 136: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 137: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 138: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 139: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 140: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 141: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 142: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 143: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 144: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 145: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 146: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 147: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 148: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 149: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 150: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 151: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 152: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 153: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 154: Hoare triple {15638#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + ~incr~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15638#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 155: Hoare triple {15638#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15638#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 156: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 157: Hoare triple {15638#false} assume !(~i~0 < 100000); {15638#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 158: Hoare triple {15638#false} havoc ~x~0;~x~0 := 0; {15638#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 159: Hoare triple {15638#false} assume true; {15638#false} is VALID [2018-11-18 22:56:45,612 INFO L273 TraceCheckUtils]: 160: Hoare triple {15638#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {15638#false} is VALID [2018-11-18 22:56:45,612 INFO L256 TraceCheckUtils]: 161: Hoare triple {15638#false} call __VERIFIER_assert((if #t~mem6 == 42 + ~incr~0 then 1 else 0)); {15638#false} is VALID [2018-11-18 22:56:45,612 INFO L273 TraceCheckUtils]: 162: Hoare triple {15638#false} ~cond := #in~cond; {15638#false} is VALID [2018-11-18 22:56:45,612 INFO L273 TraceCheckUtils]: 163: Hoare triple {15638#false} assume 0 == ~cond; {15638#false} is VALID [2018-11-18 22:56:45,612 INFO L273 TraceCheckUtils]: 164: Hoare triple {15638#false} assume !false; {15638#false} is VALID [2018-11-18 22:56:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-18 22:56:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:45,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:56:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE