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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy8_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,351 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-23 11:51:45,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,385 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,388 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,388 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,389 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,391 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_false-unreach-call_ground.i [2018-11-23 11:51:45,568 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21753a76/59c6aa3b38504c0989efac2ad95f8a49/FLAG63d39d3d7 [2018-11-23 11:51:45,990 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,991 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_false-unreach-call_ground.i [2018-11-23 11:51:45,998 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21753a76/59c6aa3b38504c0989efac2ad95f8a49/FLAG63d39d3d7 [2018-11-23 11:51:46,361 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21753a76/59c6aa3b38504c0989efac2ad95f8a49 [2018-11-23 11:51:46,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,426 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,652 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,658 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,721 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,758 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (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-23 11:51:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:47,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:48,188 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:48,188 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 11:51:48,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48 BoogieIcfgContainer [2018-11-23 11:51:48,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:48,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:48,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:48,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:48,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:48,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35175091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:48,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35175091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48" (3/3) ... [2018-11-23 11:51:48,198 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy8_false-unreach-call_ground.i [2018-11-23 11:51:48,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:48,217 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:48,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,269 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,270 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,270 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,271 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,271 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,271 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-23 11:51:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:48,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-23 11:51:48,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 661673386, now seen corresponding path program 1 times [2018-11-23 11:51:48,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {51#true} is VALID [2018-11-23 11:51:48,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {51#true} is VALID [2018-11-23 11:51:48,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2018-11-23 11:51:48,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #161#return; {51#true} is VALID [2018-11-23 11:51:48,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret22 := main(); {51#true} is VALID [2018-11-23 11:51:48,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {51#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {51#true} is VALID [2018-11-23 11:51:48,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {51#true} assume !true; {52#false} is VALID [2018-11-23 11:51:48,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {52#false} havoc ~i~0;~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {52#false} assume !(~i~0 < 100000); {52#false} is VALID [2018-11-23 11:51:48,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {52#false} assume !(~i~0 < 100000); {52#false} is VALID [2018-11-23 11:51:48,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {52#false} assume !(~i~0 < 100000); {52#false} is VALID [2018-11-23 11:51:48,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {52#false} assume !(~i~0 < 100000); {52#false} is VALID [2018-11-23 11:51:48,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {52#false} assume !(~i~0 < 100000); {52#false} is VALID [2018-11-23 11:51:48,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-23 11:51:48,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-23 11:51:48,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {52#false} ~i~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-23 11:51:48,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {52#false} havoc ~x~0;~x~0 := 0; {52#false} is VALID [2018-11-23 11:51:48,490 INFO L273 TraceCheckUtils]: 24: Hoare triple {52#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {52#false} is VALID [2018-11-23 11:51:48,491 INFO L256 TraceCheckUtils]: 25: Hoare triple {52#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {52#false} is VALID [2018-11-23 11:51:48,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2018-11-23 11:51:48,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2018-11-23 11:51:48,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {52#false} assume !false; {52#false} is VALID [2018-11-23 11:51:48,497 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-23 11:51:48,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,506 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:51:48,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,685 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-11-23 11:51:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,192 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2018-11-23 11:51:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:49,192 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:51:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2018-11-23 11:51:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2018-11-23 11:51:49,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 127 transitions. [2018-11-23 11:51:49,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,774 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:51:49,774 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:51:49,778 INFO L631 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-23 11:51:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:51:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 11:51:49,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 11:51:49,838 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:51:49,838 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:51:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,844 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 11:51:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 11:51:49,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,846 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:51:49,846 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:51:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,851 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 11:51:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 11:51:49,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:51:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 11:51:49,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2018-11-23 11:51:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,859 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 11:51:49,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 11:51:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:49,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-23 11:51:49,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 904564754, now seen corresponding path program 1 times [2018-11-23 11:51:49,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {315#true} is VALID [2018-11-23 11:51:49,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {315#true} is VALID [2018-11-23 11:51:49,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2018-11-23 11:51:49,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #161#return; {315#true} is VALID [2018-11-23 11:51:49,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret22 := main(); {315#true} is VALID [2018-11-23 11:51:49,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {315#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {317#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(= main_~a~0 0)} assume !(~a~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {316#false} havoc ~i~0;~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {316#false} ~i~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {316#false} assume !(~i~0 < 100000); {316#false} is VALID [2018-11-23 11:51:50,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {316#false} havoc ~x~0;~x~0 := 0; {316#false} is VALID [2018-11-23 11:51:50,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {316#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {316#false} is VALID [2018-11-23 11:51:50,008 INFO L256 TraceCheckUtils]: 25: Hoare triple {316#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {316#false} is VALID [2018-11-23 11:51:50,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {316#false} ~cond := #in~cond; {316#false} is VALID [2018-11-23 11:51:50,012 INFO L273 TraceCheckUtils]: 27: Hoare triple {316#false} assume 0 == ~cond; {316#false} is VALID [2018-11-23 11:51:50,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {316#false} assume !false; {316#false} is VALID [2018-11-23 11:51:50,014 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-23 11:51:50,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:51:50,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,103 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2018-11-23 11:51:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,381 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2018-11-23 11:51:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:51:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 11:51:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 11:51:50,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 11:51:50,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,605 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:51:50,606 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:51:50,607 INFO L631 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-23 11:51:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:51:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:51:50,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:50,631 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:50,631 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,635 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 11:51:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 11:51:50,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,636 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:50,636 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,640 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 11:51:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 11:51:50,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:51:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 11:51:50,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 29 [2018-11-23 11:51:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,644 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 11:51:50,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 11:51:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:50,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:51:50,647 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1833019696, now seen corresponding path program 1 times [2018-11-23 11:51:50,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {579#true} call ULTIMATE.init(); {579#true} is VALID [2018-11-23 11:51:50,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {579#true} is VALID [2018-11-23 11:51:50,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {579#true} assume true; {579#true} is VALID [2018-11-23 11:51:50,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {579#true} {579#true} #161#return; {579#true} is VALID [2018-11-23 11:51:50,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {579#true} call #t~ret22 := main(); {579#true} is VALID [2018-11-23 11:51:50,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {579#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {579#true} is VALID [2018-11-23 11:51:50,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {579#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {579#true} is VALID [2018-11-23 11:51:50,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {579#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {579#true} is VALID [2018-11-23 11:51:50,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {579#true} assume !(~a~0 < 100000); {579#true} is VALID [2018-11-23 11:51:50,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {579#true} havoc ~i~0;~i~0 := 0; {581#(= main_~i~0 0)} is VALID [2018-11-23 11:51:50,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {581#(= main_~i~0 0)} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {580#false} ~i~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {580#false} assume !(~i~0 < 100000); {580#false} is VALID [2018-11-23 11:51:50,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {580#false} havoc ~x~0;~x~0 := 0; {580#false} is VALID [2018-11-23 11:51:50,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {580#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {580#false} is VALID [2018-11-23 11:51:50,754 INFO L256 TraceCheckUtils]: 27: Hoare triple {580#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {580#false} is VALID [2018-11-23 11:51:50,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {580#false} ~cond := #in~cond; {580#false} is VALID [2018-11-23 11:51:50,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {580#false} assume 0 == ~cond; {580#false} is VALID [2018-11-23 11:51:50,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {580#false} assume !false; {580#false} is VALID [2018-11-23 11:51:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:51:50,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,822 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-23 11:51:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,183 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2018-11-23 11:51:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:51,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:51:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2018-11-23 11:51:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2018-11-23 11:51:51,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2018-11-23 11:51:51,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,420 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:51:51,420 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:51:51,421 INFO L631 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-23 11:51:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:51:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-23 11:51:51,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-23 11:51:51,459 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-23 11:51:51,460 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-23 11:51:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,464 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 11:51:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-23 11:51:51,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,465 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-23 11:51:51,465 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-23 11:51:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,469 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 11:51:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-23 11:51:51,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:51:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-23 11:51:51,473 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 31 [2018-11-23 11:51:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,474 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-23 11:51:51,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 11:51:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:51:51,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:51:51,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1518385952, now seen corresponding path program 1 times [2018-11-23 11:51:51,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {908#true} call ULTIMATE.init(); {908#true} is VALID [2018-11-23 11:51:51,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {908#true} is VALID [2018-11-23 11:51:51,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-23 11:51:51,642 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {908#true} {908#true} #161#return; {908#true} is VALID [2018-11-23 11:51:51,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {908#true} call #t~ret22 := main(); {908#true} is VALID [2018-11-23 11:51:51,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {908#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {910#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {910#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {910#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {910#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {911#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {911#(<= main_~a~0 1)} assume !(~a~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {909#false} havoc ~i~0;~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {909#false} is VALID [2018-11-23 11:51:51,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {909#false} is VALID [2018-11-23 11:51:51,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {909#false} is VALID [2018-11-23 11:51:51,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {909#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {909#false} is VALID [2018-11-23 11:51:51,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {909#false} is VALID [2018-11-23 11:51:51,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {909#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {909#false} is VALID [2018-11-23 11:51:51,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {909#false} is VALID [2018-11-23 11:51:51,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {909#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {909#false} is VALID [2018-11-23 11:51:51,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {909#false} is VALID [2018-11-23 11:51:51,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {909#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {909#false} is VALID [2018-11-23 11:51:51,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,652 INFO L273 TraceCheckUtils]: 30: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {909#false} is VALID [2018-11-23 11:51:51,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {909#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {909#false} is VALID [2018-11-23 11:51:51,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {909#false} is VALID [2018-11-23 11:51:51,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {909#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {909#false} is VALID [2018-11-23 11:51:51,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {909#false} is VALID [2018-11-23 11:51:51,655 INFO L273 TraceCheckUtils]: 39: Hoare triple {909#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {909#false} is VALID [2018-11-23 11:51:51,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:51,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {909#false} havoc ~x~0;~x~0 := 0; {909#false} is VALID [2018-11-23 11:51:51,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {909#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {909#false} is VALID [2018-11-23 11:51:51,658 INFO L256 TraceCheckUtils]: 43: Hoare triple {909#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {909#false} is VALID [2018-11-23 11:51:51,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {909#false} ~cond := #in~cond; {909#false} is VALID [2018-11-23 11:51:51,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {909#false} assume 0 == ~cond; {909#false} is VALID [2018-11-23 11:51:51,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {909#false} assume !false; {909#false} is VALID [2018-11-23 11:51:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:51:51,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,663 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-23 11:51:51,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {908#true} call ULTIMATE.init(); {908#true} is VALID [2018-11-23 11:51:52,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {908#true} is VALID [2018-11-23 11:51:52,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-23 11:51:52,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {908#true} {908#true} #161#return; {908#true} is VALID [2018-11-23 11:51:52,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {908#true} call #t~ret22 := main(); {908#true} is VALID [2018-11-23 11:51:52,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {908#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {930#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:52,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {930#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {930#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:52,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {930#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {911#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {911#(<= main_~a~0 1)} assume !(~a~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {909#false} havoc ~i~0;~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {909#false} is VALID [2018-11-23 11:51:52,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {909#false} is VALID [2018-11-23 11:51:52,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {909#false} is VALID [2018-11-23 11:51:52,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {909#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {909#false} is VALID [2018-11-23 11:51:52,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {909#false} is VALID [2018-11-23 11:51:52,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {909#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {909#false} is VALID [2018-11-23 11:51:52,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {909#false} is VALID [2018-11-23 11:51:52,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {909#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {909#false} is VALID [2018-11-23 11:51:52,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {909#false} is VALID [2018-11-23 11:51:52,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {909#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {909#false} is VALID [2018-11-23 11:51:52,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {909#false} is VALID [2018-11-23 11:51:52,334 INFO L273 TraceCheckUtils]: 31: Hoare triple {909#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {909#false} is VALID [2018-11-23 11:51:52,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {909#false} is VALID [2018-11-23 11:51:52,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {909#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {909#false} is VALID [2018-11-23 11:51:52,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {909#false} ~i~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {909#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {909#false} is VALID [2018-11-23 11:51:52,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {909#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {909#false} is VALID [2018-11-23 11:51:52,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {909#false} assume !(~i~0 < 100000); {909#false} is VALID [2018-11-23 11:51:52,347 INFO L273 TraceCheckUtils]: 41: Hoare triple {909#false} havoc ~x~0;~x~0 := 0; {909#false} is VALID [2018-11-23 11:51:52,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {909#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {909#false} is VALID [2018-11-23 11:51:52,348 INFO L256 TraceCheckUtils]: 43: Hoare triple {909#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {909#false} is VALID [2018-11-23 11:51:52,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {909#false} ~cond := #in~cond; {909#false} is VALID [2018-11-23 11:51:52,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {909#false} assume 0 == ~cond; {909#false} is VALID [2018-11-23 11:51:52,349 INFO L273 TraceCheckUtils]: 46: Hoare triple {909#false} assume !false; {909#false} is VALID [2018-11-23 11:51:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:51:52,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:52,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-23 11:51:52,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:52,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:52,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:52,597 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 5 states. [2018-11-23 11:51:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,019 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-11-23 11:51:53,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:53,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-23 11:51:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-23 11:51:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-23 11:51:53,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2018-11-23 11:51:53,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,211 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:51:53,211 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:53,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-23 11:51:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 11:51:53,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 11:51:53,296 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 11:51:53,296 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 11:51:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,299 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 11:51:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 11:51:53,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,300 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 11:51:53,300 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 11:51:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,303 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 11:51:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 11:51:53,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:51:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 11:51:53,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 47 [2018-11-23 11:51:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,308 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 11:51:53,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 11:51:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:51:53,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,310 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:51:53,310 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash -946140994, now seen corresponding path program 2 times [2018-11-23 11:51:53,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2018-11-23 11:51:53,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1386#true} is VALID [2018-11-23 11:51:53,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 11:51:53,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #161#return; {1386#true} is VALID [2018-11-23 11:51:53,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret22 := main(); {1386#true} is VALID [2018-11-23 11:51:53,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {1386#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1388#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1388#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {1388#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1389#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {1389#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1389#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {1389#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1390#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {1390#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {1387#false} havoc ~i~0;~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1387#false} is VALID [2018-11-23 11:51:53,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {1387#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1387#false} is VALID [2018-11-23 11:51:53,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1387#false} is VALID [2018-11-23 11:51:53,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {1387#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1387#false} is VALID [2018-11-23 11:51:53,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1387#false} is VALID [2018-11-23 11:51:53,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {1387#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1387#false} is VALID [2018-11-23 11:51:53,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1387#false} is VALID [2018-11-23 11:51:53,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {1387#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1387#false} is VALID [2018-11-23 11:51:53,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1387#false} is VALID [2018-11-23 11:51:53,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {1387#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1387#false} is VALID [2018-11-23 11:51:53,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,490 INFO L273 TraceCheckUtils]: 32: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1387#false} is VALID [2018-11-23 11:51:53,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {1387#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1387#false} is VALID [2018-11-23 11:51:53,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,491 INFO L273 TraceCheckUtils]: 35: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1387#false} is VALID [2018-11-23 11:51:53,492 INFO L273 TraceCheckUtils]: 37: Hoare triple {1387#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1387#false} is VALID [2018-11-23 11:51:53,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1387#false} is VALID [2018-11-23 11:51:53,493 INFO L273 TraceCheckUtils]: 41: Hoare triple {1387#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1387#false} is VALID [2018-11-23 11:51:53,493 INFO L273 TraceCheckUtils]: 42: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {1387#false} havoc ~x~0;~x~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {1387#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {1387#false} is VALID [2018-11-23 11:51:53,494 INFO L256 TraceCheckUtils]: 45: Hoare triple {1387#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {1387#false} is VALID [2018-11-23 11:51:53,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2018-11-23 11:51:53,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2018-11-23 11:51:53,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2018-11-23 11:51:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:51:53,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,499 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-23 11:51:53,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:53,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:53,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2018-11-23 11:51:53,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1386#true} is VALID [2018-11-23 11:51:53,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 11:51:53,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #161#return; {1386#true} is VALID [2018-11-23 11:51:53,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret22 := main(); {1386#true} is VALID [2018-11-23 11:51:53,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {1386#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1386#true} is VALID [2018-11-23 11:51:53,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {1386#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1386#true} is VALID [2018-11-23 11:51:53,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {1386#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 11:51:53,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {1386#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1386#true} is VALID [2018-11-23 11:51:53,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {1386#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 11:51:53,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {1386#true} assume !(~a~0 < 100000); {1386#true} is VALID [2018-11-23 11:51:53,890 INFO L273 TraceCheckUtils]: 11: Hoare triple {1386#true} havoc ~i~0;~i~0 := 0; {1386#true} is VALID [2018-11-23 11:51:53,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {1386#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1386#true} is VALID [2018-11-23 11:51:53,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {1386#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1386#true} is VALID [2018-11-23 11:51:53,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {1386#true} assume !(~i~0 < 100000); {1386#true} is VALID [2018-11-23 11:51:53,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {1386#true} ~i~0 := 0; {1386#true} is VALID [2018-11-23 11:51:53,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1386#true} is VALID [2018-11-23 11:51:53,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1386#true} is VALID [2018-11-23 11:51:53,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {1386#true} assume !(~i~0 < 100000); {1386#true} is VALID [2018-11-23 11:51:53,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {1386#true} ~i~0 := 0; {1386#true} is VALID [2018-11-23 11:51:53,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {1386#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1386#true} is VALID [2018-11-23 11:51:53,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {1386#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1386#true} is VALID [2018-11-23 11:51:53,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {1386#true} assume !(~i~0 < 100000); {1386#true} is VALID [2018-11-23 11:51:53,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {1386#true} ~i~0 := 0; {1386#true} is VALID [2018-11-23 11:51:53,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {1386#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1386#true} is VALID [2018-11-23 11:51:53,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {1386#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1386#true} is VALID [2018-11-23 11:51:53,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {1386#true} assume !(~i~0 < 100000); {1386#true} is VALID [2018-11-23 11:51:53,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {1386#true} ~i~0 := 0; {1386#true} is VALID [2018-11-23 11:51:53,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {1386#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1386#true} is VALID [2018-11-23 11:51:53,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {1386#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1386#true} is VALID [2018-11-23 11:51:53,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {1386#true} assume !(~i~0 < 100000); {1386#true} is VALID [2018-11-23 11:51:53,912 INFO L273 TraceCheckUtils]: 31: Hoare triple {1386#true} ~i~0 := 0; {1487#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {1487#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1487#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {1487#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1494#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {1494#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1387#false} is VALID [2018-11-23 11:51:53,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {1387#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1387#false} is VALID [2018-11-23 11:51:53,937 INFO L273 TraceCheckUtils]: 38: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,937 INFO L273 TraceCheckUtils]: 39: Hoare triple {1387#false} ~i~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {1387#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1387#false} is VALID [2018-11-23 11:51:53,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {1387#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1387#false} is VALID [2018-11-23 11:51:53,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {1387#false} assume !(~i~0 < 100000); {1387#false} is VALID [2018-11-23 11:51:53,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {1387#false} havoc ~x~0;~x~0 := 0; {1387#false} is VALID [2018-11-23 11:51:53,938 INFO L273 TraceCheckUtils]: 44: Hoare triple {1387#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {1387#false} is VALID [2018-11-23 11:51:53,939 INFO L256 TraceCheckUtils]: 45: Hoare triple {1387#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {1387#false} is VALID [2018-11-23 11:51:53,939 INFO L273 TraceCheckUtils]: 46: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2018-11-23 11:51:53,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2018-11-23 11:51:53,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2018-11-23 11:51:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:51:53,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:51:53,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-23 11:51:53,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:54,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:54,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:54,148 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2018-11-23 11:51:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,908 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-11-23 11:51:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:54,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-23 11:51:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2018-11-23 11:51:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2018-11-23 11:51:54,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 142 transitions. [2018-11-23 11:51:55,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,141 INFO L225 Difference]: With dead ends: 124 [2018-11-23 11:51:55,141 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:51:55,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:51:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-11-23 11:51:55,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:55,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 72 states. [2018-11-23 11:51:55,180 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 72 states. [2018-11-23 11:51:55,181 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 72 states. [2018-11-23 11:51:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,184 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-23 11:51:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 11:51:55,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,185 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 81 states. [2018-11-23 11:51:55,185 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 81 states. [2018-11-23 11:51:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,189 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-23 11:51:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 11:51:55,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:55,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:51:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-23 11:51:55,194 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 49 [2018-11-23 11:51:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:55,194 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-23 11:51:55,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 11:51:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:51:55,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:55,196 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:55,196 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:55,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1302503220, now seen corresponding path program 3 times [2018-11-23 11:51:55,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:55,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {1986#true} call ULTIMATE.init(); {1986#true} is VALID [2018-11-23 11:51:55,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {1986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1986#true} is VALID [2018-11-23 11:51:55,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {1986#true} assume true; {1986#true} is VALID [2018-11-23 11:51:55,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1986#true} {1986#true} #161#return; {1986#true} is VALID [2018-11-23 11:51:55,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {1986#true} call #t~ret22 := main(); {1986#true} is VALID [2018-11-23 11:51:55,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {1986#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1988#(= main_~a~0 0)} is VALID [2018-11-23 11:51:55,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {1988#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1988#(= main_~a~0 0)} is VALID [2018-11-23 11:51:55,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {1988#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1989#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {1989#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1989#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {1989#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1990#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {1990#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1990#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {1990#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1991#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {1991#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {1987#false} havoc ~i~0;~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1987#false} is VALID [2018-11-23 11:51:55,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {1987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1987#false} is VALID [2018-11-23 11:51:55,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1987#false} is VALID [2018-11-23 11:51:55,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {1987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1987#false} is VALID [2018-11-23 11:51:55,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1987#false} is VALID [2018-11-23 11:51:55,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {1987#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1987#false} is VALID [2018-11-23 11:51:55,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1987#false} is VALID [2018-11-23 11:51:55,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {1987#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1987#false} is VALID [2018-11-23 11:51:55,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1987#false} is VALID [2018-11-23 11:51:55,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {1987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1987#false} is VALID [2018-11-23 11:51:55,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1987#false} is VALID [2018-11-23 11:51:55,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {1987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1987#false} is VALID [2018-11-23 11:51:55,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1987#false} is VALID [2018-11-23 11:51:55,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {1987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1987#false} is VALID [2018-11-23 11:51:55,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1987#false} is VALID [2018-11-23 11:51:55,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {1987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1987#false} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 37: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 38: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1987#false} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {1987#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1987#false} is VALID [2018-11-23 11:51:55,365 INFO L273 TraceCheckUtils]: 40: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1987#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {1987#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1987#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 42: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 43: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 44: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1987#false} is VALID [2018-11-23 11:51:55,366 INFO L273 TraceCheckUtils]: 45: Hoare triple {1987#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1987#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1987#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 47: Hoare triple {1987#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1987#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 49: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,367 INFO L273 TraceCheckUtils]: 50: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1987#false} is VALID [2018-11-23 11:51:55,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {1987#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1987#false} is VALID [2018-11-23 11:51:55,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1987#false} is VALID [2018-11-23 11:51:55,368 INFO L273 TraceCheckUtils]: 53: Hoare triple {1987#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1987#false} is VALID [2018-11-23 11:51:55,368 INFO L273 TraceCheckUtils]: 54: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,368 INFO L273 TraceCheckUtils]: 55: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1987#false} is VALID [2018-11-23 11:51:55,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {1987#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1987#false} is VALID [2018-11-23 11:51:55,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1987#false} is VALID [2018-11-23 11:51:55,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {1987#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1987#false} is VALID [2018-11-23 11:51:55,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {1987#false} havoc ~x~0;~x~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {1987#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {1987#false} is VALID [2018-11-23 11:51:55,370 INFO L256 TraceCheckUtils]: 63: Hoare triple {1987#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {1987#false} is VALID [2018-11-23 11:51:55,370 INFO L273 TraceCheckUtils]: 64: Hoare triple {1987#false} ~cond := #in~cond; {1987#false} is VALID [2018-11-23 11:51:55,370 INFO L273 TraceCheckUtils]: 65: Hoare triple {1987#false} assume 0 == ~cond; {1987#false} is VALID [2018-11-23 11:51:55,371 INFO L273 TraceCheckUtils]: 66: Hoare triple {1987#false} assume !false; {1987#false} is VALID [2018-11-23 11:51:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:51:55,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:55,376 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-23 11:51:55,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:55,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:51:55,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {1986#true} call ULTIMATE.init(); {1986#true} is VALID [2018-11-23 11:51:55,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {1986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1986#true} is VALID [2018-11-23 11:51:55,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {1986#true} assume true; {1986#true} is VALID [2018-11-23 11:51:55,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1986#true} {1986#true} #161#return; {1986#true} is VALID [2018-11-23 11:51:55,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {1986#true} call #t~ret22 := main(); {1986#true} is VALID [2018-11-23 11:51:55,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {1986#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1986#true} is VALID [2018-11-23 11:51:55,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {1986#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1986#true} is VALID [2018-11-23 11:51:55,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {1986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1986#true} is VALID [2018-11-23 11:51:55,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {1986#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1986#true} is VALID [2018-11-23 11:51:55,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {1986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1986#true} is VALID [2018-11-23 11:51:55,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {1986#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1986#true} is VALID [2018-11-23 11:51:55,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {1986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1986#true} is VALID [2018-11-23 11:51:55,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {1986#true} assume !(~a~0 < 100000); {1986#true} is VALID [2018-11-23 11:51:55,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {1986#true} havoc ~i~0;~i~0 := 0; {1986#true} is VALID [2018-11-23 11:51:55,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {1986#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1986#true} is VALID [2018-11-23 11:51:55,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {1986#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1986#true} is VALID [2018-11-23 11:51:55,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {1986#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1986#true} is VALID [2018-11-23 11:51:55,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {1986#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1986#true} is VALID [2018-11-23 11:51:55,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {1986#true} assume !(~i~0 < 100000); {1986#true} is VALID [2018-11-23 11:51:55,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {1986#true} ~i~0 := 0; {1986#true} is VALID [2018-11-23 11:51:55,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {1986#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1986#true} is VALID [2018-11-23 11:51:55,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {1986#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1986#true} is VALID [2018-11-23 11:51:55,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {1986#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1986#true} is VALID [2018-11-23 11:51:55,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {1986#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1986#true} is VALID [2018-11-23 11:51:55,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {1986#true} assume !(~i~0 < 100000); {1986#true} is VALID [2018-11-23 11:51:55,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {1986#true} ~i~0 := 0; {1986#true} is VALID [2018-11-23 11:51:55,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {1986#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1986#true} is VALID [2018-11-23 11:51:55,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {1986#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1986#true} is VALID [2018-11-23 11:51:55,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {1986#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1986#true} is VALID [2018-11-23 11:51:55,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {1986#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1986#true} is VALID [2018-11-23 11:51:55,684 INFO L273 TraceCheckUtils]: 30: Hoare triple {1986#true} assume !(~i~0 < 100000); {1986#true} is VALID [2018-11-23 11:51:55,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {1986#true} ~i~0 := 0; {2088#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {2088#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2088#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {2088#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2095#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {2095#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2095#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,698 INFO L273 TraceCheckUtils]: 35: Hoare triple {2095#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2102#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {2102#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1987#false} is VALID [2018-11-23 11:51:55,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {1987#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1987#false} is VALID [2018-11-23 11:51:55,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {1987#false} is VALID [2018-11-23 11:51:55,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {1987#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {1987#false} is VALID [2018-11-23 11:51:55,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,703 INFO L273 TraceCheckUtils]: 44: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1987#false} is VALID [2018-11-23 11:51:55,703 INFO L273 TraceCheckUtils]: 45: Hoare triple {1987#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1987#false} is VALID [2018-11-23 11:51:55,704 INFO L273 TraceCheckUtils]: 46: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {1987#false} is VALID [2018-11-23 11:51:55,704 INFO L273 TraceCheckUtils]: 47: Hoare triple {1987#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {1987#false} is VALID [2018-11-23 11:51:55,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1987#false} is VALID [2018-11-23 11:51:55,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {1987#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1987#false} is VALID [2018-11-23 11:51:55,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {1987#false} is VALID [2018-11-23 11:51:55,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {1987#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1987#false} is VALID [2018-11-23 11:51:55,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {1987#false} ~i~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,706 INFO L273 TraceCheckUtils]: 56: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1987#false} is VALID [2018-11-23 11:51:55,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {1987#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1987#false} is VALID [2018-11-23 11:51:55,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {1987#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {1987#false} is VALID [2018-11-23 11:51:55,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {1987#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {1987#false} is VALID [2018-11-23 11:51:55,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {1987#false} assume !(~i~0 < 100000); {1987#false} is VALID [2018-11-23 11:51:55,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {1987#false} havoc ~x~0;~x~0 := 0; {1987#false} is VALID [2018-11-23 11:51:55,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {1987#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {1987#false} is VALID [2018-11-23 11:51:55,707 INFO L256 TraceCheckUtils]: 63: Hoare triple {1987#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {1987#false} is VALID [2018-11-23 11:51:55,708 INFO L273 TraceCheckUtils]: 64: Hoare triple {1987#false} ~cond := #in~cond; {1987#false} is VALID [2018-11-23 11:51:55,708 INFO L273 TraceCheckUtils]: 65: Hoare triple {1987#false} assume 0 == ~cond; {1987#false} is VALID [2018-11-23 11:51:55,708 INFO L273 TraceCheckUtils]: 66: Hoare triple {1987#false} assume !false; {1987#false} is VALID [2018-11-23 11:51:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 11:51:55,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:51:55,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 11:51:55,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:55,833 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-23 11:51:55,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:55,834 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2018-11-23 11:51:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,092 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2018-11-23 11:51:57,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:57,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 11:51:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2018-11-23 11:51:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2018-11-23 11:51:57,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 160 transitions. [2018-11-23 11:51:57,305 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-23 11:51:57,307 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:51:57,307 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:51:57,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:51:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2018-11-23 11:51:57,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:57,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 90 states. [2018-11-23 11:51:57,362 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 90 states. [2018-11-23 11:51:57,362 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 90 states. [2018-11-23 11:51:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,365 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-11-23 11:51:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-11-23 11:51:57,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,366 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 99 states. [2018-11-23 11:51:57,366 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 99 states. [2018-11-23 11:51:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,370 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-11-23 11:51:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-11-23 11:51:57,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:57,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:51:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 11:51:57,374 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 67 [2018-11-23 11:51:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 11:51:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 11:51:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:51:57,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:57,375 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-23 11:51:57,376 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:57,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2145096026, now seen corresponding path program 4 times [2018-11-23 11:51:57,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2756#true} is VALID [2018-11-23 11:51:57,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {2756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2756#true} is VALID [2018-11-23 11:51:57,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2018-11-23 11:51:57,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #161#return; {2756#true} is VALID [2018-11-23 11:51:57,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret22 := main(); {2756#true} is VALID [2018-11-23 11:51:57,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {2756#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2758#(= main_~a~0 0)} is VALID [2018-11-23 11:51:57,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {2758#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2758#(= main_~a~0 0)} is VALID [2018-11-23 11:51:57,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {2758#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2759#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {2759#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2759#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {2759#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2760#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {2760#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2760#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {2760#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2761#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {2761#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2761#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {2761#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2762#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:57,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {2762#(<= main_~a~0 4)} assume !(~a~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {2757#false} havoc ~i~0;~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2757#false} is VALID [2018-11-23 11:51:57,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {2757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2757#false} is VALID [2018-11-23 11:51:57,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2757#false} is VALID [2018-11-23 11:51:57,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {2757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2757#false} is VALID [2018-11-23 11:51:57,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2757#false} is VALID [2018-11-23 11:51:57,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {2757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2757#false} is VALID [2018-11-23 11:51:57,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2757#false} is VALID [2018-11-23 11:51:57,575 INFO L273 TraceCheckUtils]: 25: Hoare triple {2757#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2757#false} is VALID [2018-11-23 11:51:57,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2757#false} is VALID [2018-11-23 11:51:57,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {2757#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2757#false} is VALID [2018-11-23 11:51:57,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {2757#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {2757#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 35: Hoare triple {2757#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2757#false} is VALID [2018-11-23 11:51:57,576 INFO L273 TraceCheckUtils]: 36: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {2757#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 40: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {2757#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2757#false} is VALID [2018-11-23 11:51:57,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {2757#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {2757#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 47: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {2757#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2757#false} is VALID [2018-11-23 11:51:57,578 INFO L273 TraceCheckUtils]: 51: Hoare triple {2757#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 53: Hoare triple {2757#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 54: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 55: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 56: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 57: Hoare triple {2757#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2757#false} is VALID [2018-11-23 11:51:57,579 INFO L273 TraceCheckUtils]: 58: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 59: Hoare triple {2757#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 60: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 61: Hoare triple {2757#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 62: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 63: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 64: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 65: Hoare triple {2757#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2757#false} is VALID [2018-11-23 11:51:57,580 INFO L273 TraceCheckUtils]: 66: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 67: Hoare triple {2757#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 68: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 69: Hoare triple {2757#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 72: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2757#false} is VALID [2018-11-23 11:51:57,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {2757#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {2757#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {2757#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 78: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {2757#false} havoc ~x~0;~x~0 := 0; {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {2757#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {2757#false} is VALID [2018-11-23 11:51:57,582 INFO L256 TraceCheckUtils]: 81: Hoare triple {2757#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {2757#false} is VALID [2018-11-23 11:51:57,583 INFO L273 TraceCheckUtils]: 82: Hoare triple {2757#false} ~cond := #in~cond; {2757#false} is VALID [2018-11-23 11:51:57,583 INFO L273 TraceCheckUtils]: 83: Hoare triple {2757#false} assume 0 == ~cond; {2757#false} is VALID [2018-11-23 11:51:57,583 INFO L273 TraceCheckUtils]: 84: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2018-11-23 11:51:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 11:51:57,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:57,586 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-23 11:51:57,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:57,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:57,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:58,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2756#true} is VALID [2018-11-23 11:51:58,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {2756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2756#true} is VALID [2018-11-23 11:51:58,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2018-11-23 11:51:58,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #161#return; {2756#true} is VALID [2018-11-23 11:51:58,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret22 := main(); {2756#true} is VALID [2018-11-23 11:51:58,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {2756#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {2756#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2756#true} is VALID [2018-11-23 11:51:58,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {2756#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2756#true} is VALID [2018-11-23 11:51:58,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {2756#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2756#true} is VALID [2018-11-23 11:51:58,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {2756#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2756#true} is VALID [2018-11-23 11:51:58,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {2756#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2756#true} is VALID [2018-11-23 11:51:58,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {2756#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2756#true} is VALID [2018-11-23 11:51:58,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {2756#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2756#true} is VALID [2018-11-23 11:51:58,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {2756#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2756#true} is VALID [2018-11-23 11:51:58,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {2756#true} assume !(~a~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {2756#true} havoc ~i~0;~i~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#true} is VALID [2018-11-23 11:51:58,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {2756#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#true} is VALID [2018-11-23 11:51:58,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#true} is VALID [2018-11-23 11:51:58,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {2756#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#true} is VALID [2018-11-23 11:51:58,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2756#true} is VALID [2018-11-23 11:51:58,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {2756#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2756#true} is VALID [2018-11-23 11:51:58,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {2756#true} assume !(~i~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {2756#true} ~i~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2756#true} is VALID [2018-11-23 11:51:58,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {2756#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2756#true} is VALID [2018-11-23 11:51:58,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2756#true} is VALID [2018-11-23 11:51:58,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {2756#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2756#true} is VALID [2018-11-23 11:51:58,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2756#true} is VALID [2018-11-23 11:51:58,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {2756#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2756#true} is VALID [2018-11-23 11:51:58,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {2756#true} assume !(~i~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {2756#true} ~i~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2756#true} is VALID [2018-11-23 11:51:58,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {2756#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2756#true} is VALID [2018-11-23 11:51:58,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2756#true} is VALID [2018-11-23 11:51:58,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {2756#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2756#true} is VALID [2018-11-23 11:51:58,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2756#true} is VALID [2018-11-23 11:51:58,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {2756#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2756#true} is VALID [2018-11-23 11:51:58,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {2756#true} assume !(~i~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {2756#true} ~i~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2756#true} is VALID [2018-11-23 11:51:58,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {2756#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2756#true} is VALID [2018-11-23 11:51:58,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2756#true} is VALID [2018-11-23 11:51:58,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {2756#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2756#true} is VALID [2018-11-23 11:51:58,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2756#true} is VALID [2018-11-23 11:51:58,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {2756#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2756#true} is VALID [2018-11-23 11:51:58,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {2756#true} assume !(~i~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {2756#true} ~i~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2756#true} is VALID [2018-11-23 11:51:58,362 INFO L273 TraceCheckUtils]: 49: Hoare triple {2756#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2756#true} is VALID [2018-11-23 11:51:58,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2756#true} is VALID [2018-11-23 11:51:58,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {2756#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2756#true} is VALID [2018-11-23 11:51:58,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {2756#true} is VALID [2018-11-23 11:51:58,363 INFO L273 TraceCheckUtils]: 53: Hoare triple {2756#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {2756#true} is VALID [2018-11-23 11:51:58,363 INFO L273 TraceCheckUtils]: 54: Hoare triple {2756#true} assume !(~i~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,363 INFO L273 TraceCheckUtils]: 55: Hoare triple {2756#true} ~i~0 := 0; {2756#true} is VALID [2018-11-23 11:51:58,364 INFO L273 TraceCheckUtils]: 56: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2756#true} is VALID [2018-11-23 11:51:58,364 INFO L273 TraceCheckUtils]: 57: Hoare triple {2756#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2756#true} is VALID [2018-11-23 11:51:58,364 INFO L273 TraceCheckUtils]: 58: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2756#true} is VALID [2018-11-23 11:51:58,364 INFO L273 TraceCheckUtils]: 59: Hoare triple {2756#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2756#true} is VALID [2018-11-23 11:51:58,364 INFO L273 TraceCheckUtils]: 60: Hoare triple {2756#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {2756#true} is VALID [2018-11-23 11:51:58,364 INFO L273 TraceCheckUtils]: 61: Hoare triple {2756#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {2756#true} is VALID [2018-11-23 11:51:58,365 INFO L273 TraceCheckUtils]: 62: Hoare triple {2756#true} assume !(~i~0 < 100000); {2756#true} is VALID [2018-11-23 11:51:58,375 INFO L273 TraceCheckUtils]: 63: Hoare triple {2756#true} ~i~0 := 0; {2955#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:58,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {2955#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2955#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:58,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {2955#(<= main_~i~0 0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2962#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,379 INFO L273 TraceCheckUtils]: 66: Hoare triple {2962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2962#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,379 INFO L273 TraceCheckUtils]: 67: Hoare triple {2962#(<= main_~i~0 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2969#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,381 INFO L273 TraceCheckUtils]: 68: Hoare triple {2969#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {2969#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,381 INFO L273 TraceCheckUtils]: 69: Hoare triple {2969#(<= main_~i~0 2)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2976#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 70: Hoare triple {2976#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {2757#false} ~i~0 := 0; {2757#false} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 72: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2757#false} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {2757#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2757#false} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 74: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2757#false} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 75: Hoare triple {2757#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2757#false} is VALID [2018-11-23 11:51:58,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {2757#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 77: Hoare triple {2757#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {2757#false} assume !(~i~0 < 100000); {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 79: Hoare triple {2757#false} havoc ~x~0;~x~0 := 0; {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {2757#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L256 TraceCheckUtils]: 81: Hoare triple {2757#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 82: Hoare triple {2757#false} ~cond := #in~cond; {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {2757#false} assume 0 == ~cond; {2757#false} is VALID [2018-11-23 11:51:58,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2018-11-23 11:51:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 11:51:58,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:58,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 11:51:58,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-23 11:51:58,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:58,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:58,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:58,614 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 11 states. [2018-11-23 11:51:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,601 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-23 11:51:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:51:59,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-23 11:51:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2018-11-23 11:51:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2018-11-23 11:51:59,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 178 transitions. [2018-11-23 11:51:59,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,830 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:51:59,830 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 11:51:59,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 11:51:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-11-23 11:51:59,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:59,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 108 states. [2018-11-23 11:51:59,882 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 108 states. [2018-11-23 11:51:59,883 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 108 states. [2018-11-23 11:51:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,887 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-11-23 11:51:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-11-23 11:51:59,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,888 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 117 states. [2018-11-23 11:51:59,888 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 117 states. [2018-11-23 11:51:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,892 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-11-23 11:51:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-11-23 11:51:59,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:59,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:51:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-23 11:51:59,896 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 85 [2018-11-23 11:51:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:59,896 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-23 11:51:59,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-11-23 11:51:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:51:59,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:59,898 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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-23 11:51:59,898 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:59,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash -613385624, now seen corresponding path program 5 times [2018-11-23 11:51:59,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:59,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {3696#true} call ULTIMATE.init(); {3696#true} is VALID [2018-11-23 11:52:00,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {3696#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3696#true} is VALID [2018-11-23 11:52:00,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {3696#true} assume true; {3696#true} is VALID [2018-11-23 11:52:00,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3696#true} {3696#true} #161#return; {3696#true} is VALID [2018-11-23 11:52:00,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {3696#true} call #t~ret22 := main(); {3696#true} is VALID [2018-11-23 11:52:00,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {3696#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3698#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {3698#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3698#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {3698#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3699#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {3699#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3699#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {3699#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3700#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {3700#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3700#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {3700#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3701#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {3701#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3701#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {3701#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3702#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {3702#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3702#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {3702#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3703#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {3703#(<= main_~a~0 5)} assume !(~a~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {3697#false} havoc ~i~0;~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3697#false} is VALID [2018-11-23 11:52:00,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {3697#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3697#false} is VALID [2018-11-23 11:52:00,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3697#false} is VALID [2018-11-23 11:52:00,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {3697#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {3697#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {3697#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,580 INFO L273 TraceCheckUtils]: 28: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3697#false} is VALID [2018-11-23 11:52:00,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {3697#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3697#false} is VALID [2018-11-23 11:52:00,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3697#false} is VALID [2018-11-23 11:52:00,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {3697#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3697#false} is VALID [2018-11-23 11:52:00,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3697#false} is VALID [2018-11-23 11:52:00,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {3697#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3697#false} is VALID [2018-11-23 11:52:00,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3697#false} is VALID [2018-11-23 11:52:00,582 INFO L273 TraceCheckUtils]: 35: Hoare triple {3697#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3697#false} is VALID [2018-11-23 11:52:00,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3697#false} is VALID [2018-11-23 11:52:00,583 INFO L273 TraceCheckUtils]: 39: Hoare triple {3697#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3697#false} is VALID [2018-11-23 11:52:00,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3697#false} is VALID [2018-11-23 11:52:00,583 INFO L273 TraceCheckUtils]: 41: Hoare triple {3697#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3697#false} is VALID [2018-11-23 11:52:00,583 INFO L273 TraceCheckUtils]: 42: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 43: Hoare triple {3697#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 45: Hoare triple {3697#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 47: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {3697#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3697#false} is VALID [2018-11-23 11:52:00,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {3697#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 53: Hoare triple {3697#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 54: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 55: Hoare triple {3697#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 56: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 57: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,585 INFO L273 TraceCheckUtils]: 58: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3697#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 59: Hoare triple {3697#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3697#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 60: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3697#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 61: Hoare triple {3697#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3697#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 62: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3697#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 63: Hoare triple {3697#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3697#false} is VALID [2018-11-23 11:52:00,586 INFO L273 TraceCheckUtils]: 64: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3697#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 65: Hoare triple {3697#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3697#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 66: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 67: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 68: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3697#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 69: Hoare triple {3697#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3697#false} is VALID [2018-11-23 11:52:00,587 INFO L273 TraceCheckUtils]: 70: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 71: Hoare triple {3697#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 72: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 73: Hoare triple {3697#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 74: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 75: Hoare triple {3697#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 76: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 77: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,588 INFO L273 TraceCheckUtils]: 78: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 79: Hoare triple {3697#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 80: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 81: Hoare triple {3697#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 82: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 83: Hoare triple {3697#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 84: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3697#false} is VALID [2018-11-23 11:52:00,589 INFO L273 TraceCheckUtils]: 85: Hoare triple {3697#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3697#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 86: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 87: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 88: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 89: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:00,590 INFO L273 TraceCheckUtils]: 90: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 92: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 93: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 94: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:00,591 INFO L273 TraceCheckUtils]: 95: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 96: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 97: Hoare triple {3697#false} havoc ~x~0;~x~0 := 0; {3697#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 98: Hoare triple {3697#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {3697#false} is VALID [2018-11-23 11:52:00,592 INFO L256 TraceCheckUtils]: 99: Hoare triple {3697#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {3697#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 100: Hoare triple {3697#false} ~cond := #in~cond; {3697#false} is VALID [2018-11-23 11:52:00,592 INFO L273 TraceCheckUtils]: 101: Hoare triple {3697#false} assume 0 == ~cond; {3697#false} is VALID [2018-11-23 11:52:00,593 INFO L273 TraceCheckUtils]: 102: Hoare triple {3697#false} assume !false; {3697#false} is VALID [2018-11-23 11:52:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 11:52:00,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,599 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-23 11:52:00,617 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:34,991 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:52:34,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:35,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:35,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {3696#true} call ULTIMATE.init(); {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {3696#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {3696#true} assume true; {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3696#true} {3696#true} #161#return; {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {3696#true} call #t~ret22 := main(); {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {3696#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {3696#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {3696#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3696#true} is VALID [2018-11-23 11:52:35,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {3696#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {3696#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {3696#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {3696#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {3696#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {3696#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {3696#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3696#true} is VALID [2018-11-23 11:52:35,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {3696#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {3696#true} assume !(~a~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {3696#true} havoc ~i~0;~i~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {3696#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {3696#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {3696#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3696#true} is VALID [2018-11-23 11:52:35,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {3696#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {3696#true} assume !(~i~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {3696#true} ~i~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {3696#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {3696#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3696#true} is VALID [2018-11-23 11:52:35,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {3696#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {3696#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {3696#true} assume !(~i~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {3696#true} ~i~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {3696#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3696#true} is VALID [2018-11-23 11:52:35,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {3696#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {3696#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {3696#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {3696#true} assume !(~i~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {3696#true} ~i~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3696#true} is VALID [2018-11-23 11:52:35,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {3696#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3696#true} is VALID [2018-11-23 11:52:35,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3696#true} is VALID [2018-11-23 11:52:35,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {3696#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3696#true} is VALID [2018-11-23 11:52:35,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3696#true} is VALID [2018-11-23 11:52:35,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {3696#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3696#true} is VALID [2018-11-23 11:52:35,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3696#true} is VALID [2018-11-23 11:52:35,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {3696#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3696#true} is VALID [2018-11-23 11:52:35,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {3696#true} assume !(~i~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {3696#true} ~i~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3696#true} is VALID [2018-11-23 11:52:35,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {3696#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3696#true} is VALID [2018-11-23 11:52:35,246 INFO L273 TraceCheckUtils]: 60: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3696#true} is VALID [2018-11-23 11:52:35,246 INFO L273 TraceCheckUtils]: 61: Hoare triple {3696#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3696#true} is VALID [2018-11-23 11:52:35,246 INFO L273 TraceCheckUtils]: 62: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3696#true} is VALID [2018-11-23 11:52:35,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {3696#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3696#true} is VALID [2018-11-23 11:52:35,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {3696#true} is VALID [2018-11-23 11:52:35,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {3696#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {3696#true} is VALID [2018-11-23 11:52:35,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {3696#true} assume !(~i~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,247 INFO L273 TraceCheckUtils]: 67: Hoare triple {3696#true} ~i~0 := 0; {3696#true} is VALID [2018-11-23 11:52:35,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3696#true} is VALID [2018-11-23 11:52:35,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {3696#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3696#true} is VALID [2018-11-23 11:52:35,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3696#true} is VALID [2018-11-23 11:52:35,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {3696#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3696#true} is VALID [2018-11-23 11:52:35,248 INFO L273 TraceCheckUtils]: 72: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3696#true} is VALID [2018-11-23 11:52:35,248 INFO L273 TraceCheckUtils]: 73: Hoare triple {3696#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3696#true} is VALID [2018-11-23 11:52:35,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {3696#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {3696#true} is VALID [2018-11-23 11:52:35,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {3696#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {3696#true} is VALID [2018-11-23 11:52:35,249 INFO L273 TraceCheckUtils]: 76: Hoare triple {3696#true} assume !(~i~0 < 100000); {3696#true} is VALID [2018-11-23 11:52:35,262 INFO L273 TraceCheckUtils]: 77: Hoare triple {3696#true} ~i~0 := 0; {3938#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:35,263 INFO L273 TraceCheckUtils]: 78: Hoare triple {3938#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3938#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:35,266 INFO L273 TraceCheckUtils]: 79: Hoare triple {3938#(<= main_~i~0 0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3945#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:35,266 INFO L273 TraceCheckUtils]: 80: Hoare triple {3945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3945#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:35,268 INFO L273 TraceCheckUtils]: 81: Hoare triple {3945#(<= main_~i~0 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3952#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:35,268 INFO L273 TraceCheckUtils]: 82: Hoare triple {3952#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3952#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:35,270 INFO L273 TraceCheckUtils]: 83: Hoare triple {3952#(<= main_~i~0 2)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3959#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:35,270 INFO L273 TraceCheckUtils]: 84: Hoare triple {3959#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {3959#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:35,271 INFO L273 TraceCheckUtils]: 85: Hoare triple {3959#(<= main_~i~0 3)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:35,271 INFO L273 TraceCheckUtils]: 86: Hoare triple {3966#(<= main_~i~0 4)} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:35,271 INFO L273 TraceCheckUtils]: 87: Hoare triple {3697#false} ~i~0 := 0; {3697#false} is VALID [2018-11-23 11:52:35,271 INFO L273 TraceCheckUtils]: 88: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:35,271 INFO L273 TraceCheckUtils]: 89: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:35,271 INFO L273 TraceCheckUtils]: 90: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 91: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 92: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 93: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 94: Hoare triple {3697#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 95: Hoare triple {3697#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 96: Hoare triple {3697#false} assume !(~i~0 < 100000); {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 97: Hoare triple {3697#false} havoc ~x~0;~x~0 := 0; {3697#false} is VALID [2018-11-23 11:52:35,272 INFO L273 TraceCheckUtils]: 98: Hoare triple {3697#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {3697#false} is VALID [2018-11-23 11:52:35,273 INFO L256 TraceCheckUtils]: 99: Hoare triple {3697#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {3697#false} is VALID [2018-11-23 11:52:35,273 INFO L273 TraceCheckUtils]: 100: Hoare triple {3697#false} ~cond := #in~cond; {3697#false} is VALID [2018-11-23 11:52:35,273 INFO L273 TraceCheckUtils]: 101: Hoare triple {3697#false} assume 0 == ~cond; {3697#false} is VALID [2018-11-23 11:52:35,273 INFO L273 TraceCheckUtils]: 102: Hoare triple {3697#false} assume !false; {3697#false} is VALID [2018-11-23 11:52:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-23 11:52:35,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:52:35,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-11-23 11:52:35,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:35,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:35,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:35,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:35,420 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 13 states. [2018-11-23 11:52:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:36,343 INFO L93 Difference]: Finished difference Result 226 states and 252 transitions. [2018-11-23 11:52:36,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:36,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-11-23 11:52:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2018-11-23 11:52:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2018-11-23 11:52:36,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 196 transitions. [2018-11-23 11:52:36,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:36,551 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:52:36,551 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 11:52:36,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 11:52:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2018-11-23 11:52:37,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:37,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 126 states. [2018-11-23 11:52:37,131 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 126 states. [2018-11-23 11:52:37,131 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 126 states. [2018-11-23 11:52:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,136 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 11:52:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-11-23 11:52:37,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,137 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 135 states. [2018-11-23 11:52:37,137 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 135 states. [2018-11-23 11:52:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,142 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 11:52:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-11-23 11:52:37,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:37,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:37,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:37,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:52:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-11-23 11:52:37,148 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 103 [2018-11-23 11:52:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:37,148 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-11-23 11:52:37,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-11-23 11:52:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:52:37,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:37,150 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 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-23 11:52:37,151 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:37,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:37,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1753285642, now seen corresponding path program 6 times [2018-11-23 11:52:37,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:37,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:37,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:37,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4806#true} is VALID [2018-11-23 11:52:37,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {4806#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4806#true} is VALID [2018-11-23 11:52:37,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2018-11-23 11:52:37,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #161#return; {4806#true} is VALID [2018-11-23 11:52:37,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret22 := main(); {4806#true} is VALID [2018-11-23 11:52:37,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {4806#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4808#(= main_~a~0 0)} is VALID [2018-11-23 11:52:37,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {4808#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4808#(= main_~a~0 0)} is VALID [2018-11-23 11:52:37,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {4808#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4809#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:37,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {4809#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4809#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:37,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {4809#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4810#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:37,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {4810#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4810#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:37,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {4810#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4811#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:37,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {4811#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4811#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:37,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {4811#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4812#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:37,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {4812#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4812#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:37,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {4812#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4813#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:37,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {4813#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4813#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:37,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {4813#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4814#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:37,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {4814#(<= main_~a~0 6)} assume !(~a~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {4807#false} havoc ~i~0;~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4807#false} is VALID [2018-11-23 11:52:37,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {4807#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4807#false} is VALID [2018-11-23 11:52:37,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4807#false} is VALID [2018-11-23 11:52:37,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {4807#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4807#false} is VALID [2018-11-23 11:52:37,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4807#false} is VALID [2018-11-23 11:52:37,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {4807#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4807#false} is VALID [2018-11-23 11:52:37,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4807#false} is VALID [2018-11-23 11:52:37,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {4807#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4807#false} is VALID [2018-11-23 11:52:37,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4807#false} is VALID [2018-11-23 11:52:37,809 INFO L273 TraceCheckUtils]: 29: Hoare triple {4807#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4807#false} is VALID [2018-11-23 11:52:37,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,810 INFO L273 TraceCheckUtils]: 32: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4807#false} is VALID [2018-11-23 11:52:37,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {4807#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4807#false} is VALID [2018-11-23 11:52:37,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4807#false} is VALID [2018-11-23 11:52:37,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {4807#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4807#false} is VALID [2018-11-23 11:52:37,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4807#false} is VALID [2018-11-23 11:52:37,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {4807#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4807#false} is VALID [2018-11-23 11:52:37,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4807#false} is VALID [2018-11-23 11:52:37,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {4807#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4807#false} is VALID [2018-11-23 11:52:37,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4807#false} is VALID [2018-11-23 11:52:37,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {4807#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4807#false} is VALID [2018-11-23 11:52:37,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,812 INFO L273 TraceCheckUtils]: 43: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4807#false} is VALID [2018-11-23 11:52:37,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {4807#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4807#false} is VALID [2018-11-23 11:52:37,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4807#false} is VALID [2018-11-23 11:52:37,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {4807#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4807#false} is VALID [2018-11-23 11:52:37,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4807#false} is VALID [2018-11-23 11:52:37,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {4807#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4807#false} is VALID [2018-11-23 11:52:37,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4807#false} is VALID [2018-11-23 11:52:37,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {4807#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4807#false} is VALID [2018-11-23 11:52:37,814 INFO L273 TraceCheckUtils]: 52: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4807#false} is VALID [2018-11-23 11:52:37,814 INFO L273 TraceCheckUtils]: 53: Hoare triple {4807#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4807#false} is VALID [2018-11-23 11:52:37,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,815 INFO L273 TraceCheckUtils]: 55: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4807#false} is VALID [2018-11-23 11:52:37,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {4807#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4807#false} is VALID [2018-11-23 11:52:37,815 INFO L273 TraceCheckUtils]: 58: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4807#false} is VALID [2018-11-23 11:52:37,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {4807#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4807#false} is VALID [2018-11-23 11:52:37,816 INFO L273 TraceCheckUtils]: 60: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4807#false} is VALID [2018-11-23 11:52:37,816 INFO L273 TraceCheckUtils]: 61: Hoare triple {4807#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4807#false} is VALID [2018-11-23 11:52:37,816 INFO L273 TraceCheckUtils]: 62: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4807#false} is VALID [2018-11-23 11:52:37,817 INFO L273 TraceCheckUtils]: 63: Hoare triple {4807#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4807#false} is VALID [2018-11-23 11:52:37,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4807#false} is VALID [2018-11-23 11:52:37,817 INFO L273 TraceCheckUtils]: 65: Hoare triple {4807#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4807#false} is VALID [2018-11-23 11:52:37,817 INFO L273 TraceCheckUtils]: 66: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,817 INFO L273 TraceCheckUtils]: 67: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,818 INFO L273 TraceCheckUtils]: 68: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4807#false} is VALID [2018-11-23 11:52:37,818 INFO L273 TraceCheckUtils]: 69: Hoare triple {4807#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4807#false} is VALID [2018-11-23 11:52:37,818 INFO L273 TraceCheckUtils]: 70: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4807#false} is VALID [2018-11-23 11:52:37,818 INFO L273 TraceCheckUtils]: 71: Hoare triple {4807#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4807#false} is VALID [2018-11-23 11:52:37,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4807#false} is VALID [2018-11-23 11:52:37,819 INFO L273 TraceCheckUtils]: 73: Hoare triple {4807#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4807#false} is VALID [2018-11-23 11:52:37,819 INFO L273 TraceCheckUtils]: 74: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4807#false} is VALID [2018-11-23 11:52:37,819 INFO L273 TraceCheckUtils]: 75: Hoare triple {4807#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4807#false} is VALID [2018-11-23 11:52:37,819 INFO L273 TraceCheckUtils]: 76: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4807#false} is VALID [2018-11-23 11:52:37,820 INFO L273 TraceCheckUtils]: 77: Hoare triple {4807#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4807#false} is VALID [2018-11-23 11:52:37,820 INFO L273 TraceCheckUtils]: 78: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4807#false} is VALID [2018-11-23 11:52:37,820 INFO L273 TraceCheckUtils]: 81: Hoare triple {4807#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4807#false} is VALID [2018-11-23 11:52:37,821 INFO L273 TraceCheckUtils]: 82: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4807#false} is VALID [2018-11-23 11:52:37,821 INFO L273 TraceCheckUtils]: 83: Hoare triple {4807#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4807#false} is VALID [2018-11-23 11:52:37,821 INFO L273 TraceCheckUtils]: 84: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4807#false} is VALID [2018-11-23 11:52:37,821 INFO L273 TraceCheckUtils]: 85: Hoare triple {4807#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4807#false} is VALID [2018-11-23 11:52:37,821 INFO L273 TraceCheckUtils]: 86: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4807#false} is VALID [2018-11-23 11:52:37,822 INFO L273 TraceCheckUtils]: 87: Hoare triple {4807#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4807#false} is VALID [2018-11-23 11:52:37,822 INFO L273 TraceCheckUtils]: 88: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4807#false} is VALID [2018-11-23 11:52:37,822 INFO L273 TraceCheckUtils]: 89: Hoare triple {4807#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4807#false} is VALID [2018-11-23 11:52:37,822 INFO L273 TraceCheckUtils]: 90: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,823 INFO L273 TraceCheckUtils]: 92: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4807#false} is VALID [2018-11-23 11:52:37,823 INFO L273 TraceCheckUtils]: 93: Hoare triple {4807#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4807#false} is VALID [2018-11-23 11:52:37,823 INFO L273 TraceCheckUtils]: 94: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4807#false} is VALID [2018-11-23 11:52:37,823 INFO L273 TraceCheckUtils]: 95: Hoare triple {4807#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4807#false} is VALID [2018-11-23 11:52:37,824 INFO L273 TraceCheckUtils]: 96: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4807#false} is VALID [2018-11-23 11:52:37,824 INFO L273 TraceCheckUtils]: 97: Hoare triple {4807#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4807#false} is VALID [2018-11-23 11:52:37,824 INFO L273 TraceCheckUtils]: 98: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4807#false} is VALID [2018-11-23 11:52:37,824 INFO L273 TraceCheckUtils]: 99: Hoare triple {4807#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4807#false} is VALID [2018-11-23 11:52:37,824 INFO L273 TraceCheckUtils]: 100: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {4807#false} is VALID [2018-11-23 11:52:37,825 INFO L273 TraceCheckUtils]: 101: Hoare triple {4807#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4807#false} is VALID [2018-11-23 11:52:37,825 INFO L273 TraceCheckUtils]: 102: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,825 INFO L273 TraceCheckUtils]: 103: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,825 INFO L273 TraceCheckUtils]: 104: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:37,825 INFO L273 TraceCheckUtils]: 105: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:37,826 INFO L273 TraceCheckUtils]: 106: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:37,826 INFO L273 TraceCheckUtils]: 107: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:37,826 INFO L273 TraceCheckUtils]: 108: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:37,826 INFO L273 TraceCheckUtils]: 109: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:37,826 INFO L273 TraceCheckUtils]: 110: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:37,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:37,827 INFO L273 TraceCheckUtils]: 112: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:37,827 INFO L273 TraceCheckUtils]: 113: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:37,827 INFO L273 TraceCheckUtils]: 114: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:37,828 INFO L273 TraceCheckUtils]: 115: Hoare triple {4807#false} havoc ~x~0;~x~0 := 0; {4807#false} is VALID [2018-11-23 11:52:37,828 INFO L273 TraceCheckUtils]: 116: Hoare triple {4807#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {4807#false} is VALID [2018-11-23 11:52:37,828 INFO L256 TraceCheckUtils]: 117: Hoare triple {4807#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {4807#false} is VALID [2018-11-23 11:52:37,828 INFO L273 TraceCheckUtils]: 118: Hoare triple {4807#false} ~cond := #in~cond; {4807#false} is VALID [2018-11-23 11:52:37,828 INFO L273 TraceCheckUtils]: 119: Hoare triple {4807#false} assume 0 == ~cond; {4807#false} is VALID [2018-11-23 11:52:37,829 INFO L273 TraceCheckUtils]: 120: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2018-11-23 11:52:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 11:52:37,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:37,845 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-23 11:52:37,858 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:41,752 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:52:41,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:41,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:42,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4806#true} is VALID [2018-11-23 11:52:42,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {4806#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4806#true} is VALID [2018-11-23 11:52:42,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2018-11-23 11:52:42,170 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #161#return; {4806#true} is VALID [2018-11-23 11:52:42,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret22 := main(); {4806#true} is VALID [2018-11-23 11:52:42,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {4806#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {4806#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4806#true} is VALID [2018-11-23 11:52:42,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {4806#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {4806#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {4806#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {4806#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {4806#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {4806#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {4806#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4806#true} is VALID [2018-11-23 11:52:42,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {4806#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4806#true} is VALID [2018-11-23 11:52:42,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {4806#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4806#true} is VALID [2018-11-23 11:52:42,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {4806#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4866#(< main_~a~0 100000)} is VALID [2018-11-23 11:52:42,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {4866#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4870#(<= main_~a~0 100000)} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {4870#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 19: Hoare triple {4806#true} havoc ~i~0;~i~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {4806#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {4806#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4806#true} is VALID [2018-11-23 11:52:42,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {4806#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {4806#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {4806#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {4806#true} assume !(~i~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {4806#true} ~i~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4806#true} is VALID [2018-11-23 11:52:42,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {4806#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {4806#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {4806#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 39: Hoare triple {4806#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {4806#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4806#true} is VALID [2018-11-23 11:52:42,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {4806#true} assume !(~i~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,177 INFO L273 TraceCheckUtils]: 43: Hoare triple {4806#true} ~i~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,177 INFO L273 TraceCheckUtils]: 44: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4806#true} is VALID [2018-11-23 11:52:42,177 INFO L273 TraceCheckUtils]: 45: Hoare triple {4806#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4806#true} is VALID [2018-11-23 11:52:42,177 INFO L273 TraceCheckUtils]: 46: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4806#true} is VALID [2018-11-23 11:52:42,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {4806#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4806#true} is VALID [2018-11-23 11:52:42,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4806#true} is VALID [2018-11-23 11:52:42,178 INFO L273 TraceCheckUtils]: 49: Hoare triple {4806#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4806#true} is VALID [2018-11-23 11:52:42,178 INFO L273 TraceCheckUtils]: 50: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4806#true} is VALID [2018-11-23 11:52:42,178 INFO L273 TraceCheckUtils]: 51: Hoare triple {4806#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4806#true} is VALID [2018-11-23 11:52:42,178 INFO L273 TraceCheckUtils]: 52: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4806#true} is VALID [2018-11-23 11:52:42,178 INFO L273 TraceCheckUtils]: 53: Hoare triple {4806#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4806#true} is VALID [2018-11-23 11:52:42,178 INFO L273 TraceCheckUtils]: 54: Hoare triple {4806#true} assume !(~i~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,179 INFO L273 TraceCheckUtils]: 55: Hoare triple {4806#true} ~i~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,179 INFO L273 TraceCheckUtils]: 56: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4806#true} is VALID [2018-11-23 11:52:42,179 INFO L273 TraceCheckUtils]: 57: Hoare triple {4806#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4806#true} is VALID [2018-11-23 11:52:42,179 INFO L273 TraceCheckUtils]: 58: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4806#true} is VALID [2018-11-23 11:52:42,179 INFO L273 TraceCheckUtils]: 59: Hoare triple {4806#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4806#true} is VALID [2018-11-23 11:52:42,179 INFO L273 TraceCheckUtils]: 60: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4806#true} is VALID [2018-11-23 11:52:42,180 INFO L273 TraceCheckUtils]: 61: Hoare triple {4806#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4806#true} is VALID [2018-11-23 11:52:42,180 INFO L273 TraceCheckUtils]: 62: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4806#true} is VALID [2018-11-23 11:52:42,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {4806#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4806#true} is VALID [2018-11-23 11:52:42,198 INFO L273 TraceCheckUtils]: 64: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5012#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:42,211 INFO L273 TraceCheckUtils]: 65: Hoare triple {5012#(< main_~i~0 100000)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5016#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:42,211 INFO L273 TraceCheckUtils]: 66: Hoare triple {5016#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,211 INFO L273 TraceCheckUtils]: 67: Hoare triple {4806#true} ~i~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,212 INFO L273 TraceCheckUtils]: 68: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4806#true} is VALID [2018-11-23 11:52:42,212 INFO L273 TraceCheckUtils]: 69: Hoare triple {4806#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4806#true} is VALID [2018-11-23 11:52:42,212 INFO L273 TraceCheckUtils]: 70: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4806#true} is VALID [2018-11-23 11:52:42,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {4806#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4806#true} is VALID [2018-11-23 11:52:42,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4806#true} is VALID [2018-11-23 11:52:42,212 INFO L273 TraceCheckUtils]: 73: Hoare triple {4806#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4806#true} is VALID [2018-11-23 11:52:42,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {4806#true} is VALID [2018-11-23 11:52:42,213 INFO L273 TraceCheckUtils]: 75: Hoare triple {4806#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {4806#true} is VALID [2018-11-23 11:52:42,221 INFO L273 TraceCheckUtils]: 76: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {5012#(< main_~i~0 100000)} is VALID [2018-11-23 11:52:42,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {5012#(< main_~i~0 100000)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {5016#(<= main_~i~0 100000)} is VALID [2018-11-23 11:52:42,228 INFO L273 TraceCheckUtils]: 78: Hoare triple {5016#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {4806#true} ~i~0 := 0; {4806#true} is VALID [2018-11-23 11:52:42,229 INFO L273 TraceCheckUtils]: 80: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4806#true} is VALID [2018-11-23 11:52:42,229 INFO L273 TraceCheckUtils]: 81: Hoare triple {4806#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4806#true} is VALID [2018-11-23 11:52:42,229 INFO L273 TraceCheckUtils]: 82: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4806#true} is VALID [2018-11-23 11:52:42,229 INFO L273 TraceCheckUtils]: 83: Hoare triple {4806#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4806#true} is VALID [2018-11-23 11:52:42,229 INFO L273 TraceCheckUtils]: 84: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4806#true} is VALID [2018-11-23 11:52:42,229 INFO L273 TraceCheckUtils]: 85: Hoare triple {4806#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4806#true} is VALID [2018-11-23 11:52:42,230 INFO L273 TraceCheckUtils]: 86: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4806#true} is VALID [2018-11-23 11:52:42,230 INFO L273 TraceCheckUtils]: 87: Hoare triple {4806#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4806#true} is VALID [2018-11-23 11:52:42,230 INFO L273 TraceCheckUtils]: 88: Hoare triple {4806#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {4806#true} is VALID [2018-11-23 11:52:42,230 INFO L273 TraceCheckUtils]: 89: Hoare triple {4806#true} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {4806#true} is VALID [2018-11-23 11:52:42,230 INFO L273 TraceCheckUtils]: 90: Hoare triple {4806#true} assume !(~i~0 < 100000); {4806#true} is VALID [2018-11-23 11:52:42,237 INFO L273 TraceCheckUtils]: 91: Hoare triple {4806#true} ~i~0 := 0; {5095#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:42,238 INFO L273 TraceCheckUtils]: 92: Hoare triple {5095#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5095#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:42,243 INFO L273 TraceCheckUtils]: 93: Hoare triple {5095#(<= main_~i~0 0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5102#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,246 INFO L273 TraceCheckUtils]: 94: Hoare triple {5102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5102#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,246 INFO L273 TraceCheckUtils]: 95: Hoare triple {5102#(<= main_~i~0 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5109#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,247 INFO L273 TraceCheckUtils]: 96: Hoare triple {5109#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5109#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,247 INFO L273 TraceCheckUtils]: 97: Hoare triple {5109#(<= main_~i~0 2)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5116#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,247 INFO L273 TraceCheckUtils]: 98: Hoare triple {5116#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5116#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,248 INFO L273 TraceCheckUtils]: 99: Hoare triple {5116#(<= main_~i~0 3)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5123#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,248 INFO L273 TraceCheckUtils]: 100: Hoare triple {5123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {5123#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,249 INFO L273 TraceCheckUtils]: 101: Hoare triple {5123#(<= main_~i~0 4)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5130#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:42,249 INFO L273 TraceCheckUtils]: 102: Hoare triple {5130#(<= main_~i~0 5)} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:42,249 INFO L273 TraceCheckUtils]: 103: Hoare triple {4807#false} ~i~0 := 0; {4807#false} is VALID [2018-11-23 11:52:42,249 INFO L273 TraceCheckUtils]: 104: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:42,249 INFO L273 TraceCheckUtils]: 105: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:42,249 INFO L273 TraceCheckUtils]: 106: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 107: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 108: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 109: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 110: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 111: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 112: Hoare triple {4807#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 113: Hoare triple {4807#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {4807#false} is VALID [2018-11-23 11:52:42,250 INFO L273 TraceCheckUtils]: 114: Hoare triple {4807#false} assume !(~i~0 < 100000); {4807#false} is VALID [2018-11-23 11:52:42,251 INFO L273 TraceCheckUtils]: 115: Hoare triple {4807#false} havoc ~x~0;~x~0 := 0; {4807#false} is VALID [2018-11-23 11:52:42,251 INFO L273 TraceCheckUtils]: 116: Hoare triple {4807#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {4807#false} is VALID [2018-11-23 11:52:42,251 INFO L256 TraceCheckUtils]: 117: Hoare triple {4807#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {4807#false} is VALID [2018-11-23 11:52:42,251 INFO L273 TraceCheckUtils]: 118: Hoare triple {4807#false} ~cond := #in~cond; {4807#false} is VALID [2018-11-23 11:52:42,251 INFO L273 TraceCheckUtils]: 119: Hoare triple {4807#false} assume 0 == ~cond; {4807#false} is VALID [2018-11-23 11:52:42,251 INFO L273 TraceCheckUtils]: 120: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2018-11-23 11:52:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 11:52:42,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:42,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-11-23 11:52:42,281 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-23 11:52:42,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:42,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:52:42,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:42,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:52:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:52:42,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:42,381 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 19 states. [2018-11-23 11:52:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,180 INFO L93 Difference]: Finished difference Result 269 states and 304 transitions. [2018-11-23 11:52:44,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:44,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-23 11:52:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 232 transitions. [2018-11-23 11:52:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 232 transitions. [2018-11-23 11:52:44,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 232 transitions. [2018-11-23 11:52:44,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:44,487 INFO L225 Difference]: With dead ends: 269 [2018-11-23 11:52:44,487 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 11:52:44,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 11:52:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-23 11:52:44,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:44,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 162 states. [2018-11-23 11:52:44,643 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 162 states. [2018-11-23 11:52:44,643 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 162 states. [2018-11-23 11:52:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,649 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-11-23 11:52:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-11-23 11:52:44,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:44,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:44,650 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 162 states. [2018-11-23 11:52:44,650 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 162 states. [2018-11-23 11:52:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,655 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-11-23 11:52:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-11-23 11:52:44,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:44,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:44,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:44,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:52:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2018-11-23 11:52:44,662 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 121 [2018-11-23 11:52:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:44,662 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2018-11-23 11:52:44,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:52:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2018-11-23 11:52:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 11:52:44,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:44,664 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 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-23 11:52:44,664 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:44,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1849931630, now seen corresponding path program 7 times [2018-11-23 11:52:44,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:44,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:44,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:44,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:44,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:44,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {6177#true} call ULTIMATE.init(); {6177#true} is VALID [2018-11-23 11:52:44,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {6177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6177#true} is VALID [2018-11-23 11:52:44,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {6177#true} assume true; {6177#true} is VALID [2018-11-23 11:52:44,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6177#true} {6177#true} #161#return; {6177#true} is VALID [2018-11-23 11:52:44,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {6177#true} call #t~ret22 := main(); {6177#true} is VALID [2018-11-23 11:52:44,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {6177#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6179#(= main_~a~0 0)} is VALID [2018-11-23 11:52:44,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {6179#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6179#(= main_~a~0 0)} is VALID [2018-11-23 11:52:44,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {6179#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6180#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:44,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {6180#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6180#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:44,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {6180#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6181#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:44,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {6181#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6181#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:44,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {6181#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6182#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:44,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {6182#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6182#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:44,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {6182#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6183#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:44,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {6183#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6183#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:44,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {6183#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6184#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:44,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {6184#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6184#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:44,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {6184#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6185#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:44,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {6185#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6185#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:44,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {6185#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6186#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:44,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {6186#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6186#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:44,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {6186#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6187#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:44,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {6187#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {6178#false} havoc ~i~0;~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,933 INFO L273 TraceCheckUtils]: 27: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 36: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 40: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,935 INFO L273 TraceCheckUtils]: 43: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 44: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 46: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 47: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 48: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 49: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 50: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 51: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,936 INFO L273 TraceCheckUtils]: 52: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 53: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 56: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 57: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 58: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 59: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,937 INFO L273 TraceCheckUtils]: 60: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 61: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 62: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 63: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 64: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 65: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 66: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 67: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:44,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 71: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 72: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 74: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 75: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 76: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,939 INFO L273 TraceCheckUtils]: 77: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 78: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 79: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 80: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 81: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 82: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 83: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 84: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 85: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:44,940 INFO L273 TraceCheckUtils]: 86: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 87: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 88: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 89: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 90: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 91: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 92: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,941 INFO L273 TraceCheckUtils]: 93: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,942 INFO L273 TraceCheckUtils]: 94: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,942 INFO L273 TraceCheckUtils]: 95: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,942 INFO L273 TraceCheckUtils]: 96: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,942 INFO L273 TraceCheckUtils]: 97: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,942 INFO L273 TraceCheckUtils]: 98: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,942 INFO L273 TraceCheckUtils]: 99: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,943 INFO L273 TraceCheckUtils]: 100: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:44,943 INFO L273 TraceCheckUtils]: 101: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:44,943 INFO L273 TraceCheckUtils]: 102: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,943 INFO L273 TraceCheckUtils]: 103: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,943 INFO L273 TraceCheckUtils]: 104: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,943 INFO L273 TraceCheckUtils]: 105: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,944 INFO L273 TraceCheckUtils]: 106: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,944 INFO L273 TraceCheckUtils]: 107: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,944 INFO L273 TraceCheckUtils]: 108: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,944 INFO L273 TraceCheckUtils]: 109: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,944 INFO L273 TraceCheckUtils]: 110: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,945 INFO L273 TraceCheckUtils]: 111: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,945 INFO L273 TraceCheckUtils]: 112: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,945 INFO L273 TraceCheckUtils]: 113: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,945 INFO L273 TraceCheckUtils]: 114: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,945 INFO L273 TraceCheckUtils]: 115: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,945 INFO L273 TraceCheckUtils]: 116: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:44,946 INFO L273 TraceCheckUtils]: 117: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:44,946 INFO L273 TraceCheckUtils]: 118: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,946 INFO L273 TraceCheckUtils]: 119: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,946 INFO L273 TraceCheckUtils]: 120: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,946 INFO L273 TraceCheckUtils]: 121: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,946 INFO L273 TraceCheckUtils]: 122: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,947 INFO L273 TraceCheckUtils]: 123: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,947 INFO L273 TraceCheckUtils]: 124: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,947 INFO L273 TraceCheckUtils]: 125: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,947 INFO L273 TraceCheckUtils]: 126: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,947 INFO L273 TraceCheckUtils]: 127: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,947 INFO L273 TraceCheckUtils]: 128: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,948 INFO L273 TraceCheckUtils]: 129: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,948 INFO L273 TraceCheckUtils]: 130: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,948 INFO L273 TraceCheckUtils]: 131: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,948 INFO L273 TraceCheckUtils]: 132: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:44,948 INFO L273 TraceCheckUtils]: 133: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:44,948 INFO L273 TraceCheckUtils]: 134: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,949 INFO L273 TraceCheckUtils]: 135: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,949 INFO L273 TraceCheckUtils]: 136: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,949 INFO L273 TraceCheckUtils]: 137: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,949 INFO L273 TraceCheckUtils]: 138: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,949 INFO L273 TraceCheckUtils]: 139: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,949 INFO L273 TraceCheckUtils]: 140: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,950 INFO L273 TraceCheckUtils]: 141: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,950 INFO L273 TraceCheckUtils]: 142: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,950 INFO L273 TraceCheckUtils]: 143: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,950 INFO L273 TraceCheckUtils]: 144: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,950 INFO L273 TraceCheckUtils]: 145: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,950 INFO L273 TraceCheckUtils]: 146: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,951 INFO L273 TraceCheckUtils]: 147: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,951 INFO L273 TraceCheckUtils]: 148: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:44,951 INFO L273 TraceCheckUtils]: 149: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:44,951 INFO L273 TraceCheckUtils]: 150: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:44,951 INFO L273 TraceCheckUtils]: 151: Hoare triple {6178#false} havoc ~x~0;~x~0 := 0; {6178#false} is VALID [2018-11-23 11:52:44,951 INFO L273 TraceCheckUtils]: 152: Hoare triple {6178#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {6178#false} is VALID [2018-11-23 11:52:44,952 INFO L256 TraceCheckUtils]: 153: Hoare triple {6178#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {6178#false} is VALID [2018-11-23 11:52:44,952 INFO L273 TraceCheckUtils]: 154: Hoare triple {6178#false} ~cond := #in~cond; {6178#false} is VALID [2018-11-23 11:52:44,952 INFO L273 TraceCheckUtils]: 155: Hoare triple {6178#false} assume 0 == ~cond; {6178#false} is VALID [2018-11-23 11:52:44,952 INFO L273 TraceCheckUtils]: 156: Hoare triple {6178#false} assume !false; {6178#false} is VALID [2018-11-23 11:52:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:52:44,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:44,964 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-23 11:52:44,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:45,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {6177#true} call ULTIMATE.init(); {6177#true} is VALID [2018-11-23 11:52:45,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {6177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6177#true} is VALID [2018-11-23 11:52:45,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {6177#true} assume true; {6177#true} is VALID [2018-11-23 11:52:45,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6177#true} {6177#true} #161#return; {6177#true} is VALID [2018-11-23 11:52:45,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {6177#true} call #t~ret22 := main(); {6177#true} is VALID [2018-11-23 11:52:45,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {6177#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6206#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:45,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {6206#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6206#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:45,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {6206#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6180#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:45,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {6180#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6180#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:45,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {6180#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6181#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:45,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {6181#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6181#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:45,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {6181#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6182#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:45,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {6182#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6182#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:45,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {6182#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6183#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:45,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {6183#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6183#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:45,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {6183#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6184#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:45,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {6184#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6184#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:45,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {6184#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6185#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:45,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {6185#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6185#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:45,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {6185#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6186#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:45,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {6186#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6186#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:45,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {6186#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6187#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:45,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {6187#(<= main_~a~0 8)} assume !(~a~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {6178#false} havoc ~i~0;~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,287 INFO L273 TraceCheckUtils]: 32: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,288 INFO L273 TraceCheckUtils]: 36: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6178#false} is VALID [2018-11-23 11:52:45,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {6178#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6178#false} is VALID [2018-11-23 11:52:45,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 42: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,289 INFO L273 TraceCheckUtils]: 45: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 47: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 50: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {6178#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6178#false} is VALID [2018-11-23 11:52:45,290 INFO L273 TraceCheckUtils]: 54: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 57: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 60: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 61: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,291 INFO L273 TraceCheckUtils]: 62: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 63: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 64: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 65: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 66: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 67: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {6178#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 70: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,292 INFO L273 TraceCheckUtils]: 71: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 73: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 74: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 75: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 76: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 77: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 78: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 79: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,293 INFO L273 TraceCheckUtils]: 80: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 82: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 83: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 84: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 85: Hoare triple {6178#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 86: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,294 INFO L273 TraceCheckUtils]: 88: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 89: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 90: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 91: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 92: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 93: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 94: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 95: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 96: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,295 INFO L273 TraceCheckUtils]: 97: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 98: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 99: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 100: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 101: Hoare triple {6178#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 102: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 103: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,297 INFO L273 TraceCheckUtils]: 105: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,297 INFO L273 TraceCheckUtils]: 106: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,297 INFO L273 TraceCheckUtils]: 107: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,297 INFO L273 TraceCheckUtils]: 108: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,297 INFO L273 TraceCheckUtils]: 109: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,297 INFO L273 TraceCheckUtils]: 110: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 111: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 112: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 113: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 114: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 115: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 116: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {6178#false} is VALID [2018-11-23 11:52:45,298 INFO L273 TraceCheckUtils]: 117: Hoare triple {6178#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {6178#false} is VALID [2018-11-23 11:52:45,299 INFO L273 TraceCheckUtils]: 118: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,299 INFO L273 TraceCheckUtils]: 119: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,299 INFO L273 TraceCheckUtils]: 120: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,299 INFO L273 TraceCheckUtils]: 121: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,299 INFO L273 TraceCheckUtils]: 122: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,299 INFO L273 TraceCheckUtils]: 123: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,300 INFO L273 TraceCheckUtils]: 124: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,300 INFO L273 TraceCheckUtils]: 125: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,300 INFO L273 TraceCheckUtils]: 126: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,300 INFO L273 TraceCheckUtils]: 127: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,300 INFO L273 TraceCheckUtils]: 128: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,300 INFO L273 TraceCheckUtils]: 129: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 130: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 131: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 132: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 133: Hoare triple {6178#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 134: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 135: Hoare triple {6178#false} ~i~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,301 INFO L273 TraceCheckUtils]: 136: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 137: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 138: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 139: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 140: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 141: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 142: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 143: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,302 INFO L273 TraceCheckUtils]: 144: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 145: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 146: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 147: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 148: Hoare triple {6178#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 149: Hoare triple {6178#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 150: Hoare triple {6178#false} assume !(~i~0 < 100000); {6178#false} is VALID [2018-11-23 11:52:45,303 INFO L273 TraceCheckUtils]: 151: Hoare triple {6178#false} havoc ~x~0;~x~0 := 0; {6178#false} is VALID [2018-11-23 11:52:45,304 INFO L273 TraceCheckUtils]: 152: Hoare triple {6178#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {6178#false} is VALID [2018-11-23 11:52:45,304 INFO L256 TraceCheckUtils]: 153: Hoare triple {6178#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {6178#false} is VALID [2018-11-23 11:52:45,304 INFO L273 TraceCheckUtils]: 154: Hoare triple {6178#false} ~cond := #in~cond; {6178#false} is VALID [2018-11-23 11:52:45,304 INFO L273 TraceCheckUtils]: 155: Hoare triple {6178#false} assume 0 == ~cond; {6178#false} is VALID [2018-11-23 11:52:45,304 INFO L273 TraceCheckUtils]: 156: Hoare triple {6178#false} assume !false; {6178#false} is VALID [2018-11-23 11:52:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:52:45,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:45,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:52:45,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2018-11-23 11:52:45,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:45,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:52:45,412 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-23 11:52:45,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:52:45,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:52:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:45,413 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 12 states. [2018-11-23 11:52:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:46,042 INFO L93 Difference]: Finished difference Result 304 states and 322 transitions. [2018-11-23 11:52:46,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:46,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2018-11-23 11:52:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2018-11-23 11:52:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2018-11-23 11:52:46,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 114 transitions. [2018-11-23 11:52:46,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:46,195 INFO L225 Difference]: With dead ends: 304 [2018-11-23 11:52:46,195 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 11:52:46,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 11:52:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-11-23 11:52:46,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:46,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 164 states. [2018-11-23 11:52:46,332 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 164 states. [2018-11-23 11:52:46,332 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 164 states. [2018-11-23 11:52:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:46,336 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-11-23 11:52:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-11-23 11:52:46,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:46,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:46,337 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 165 states. [2018-11-23 11:52:46,337 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 165 states. [2018-11-23 11:52:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:46,341 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-11-23 11:52:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-11-23 11:52:46,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:46,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:46,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:46,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:52:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-11-23 11:52:46,346 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 157 [2018-11-23 11:52:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:46,347 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-11-23 11:52:46,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-11-23 11:52:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 11:52:46,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:46,349 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 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-23 11:52:46,349 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:46,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1360821840, now seen corresponding path program 8 times [2018-11-23 11:52:46,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:46,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:46,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:46,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:46,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {7686#true} call ULTIMATE.init(); {7686#true} is VALID [2018-11-23 11:52:48,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {7686#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7686#true} is VALID [2018-11-23 11:52:48,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {7686#true} assume true; {7686#true} is VALID [2018-11-23 11:52:48,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7686#true} {7686#true} #161#return; {7686#true} is VALID [2018-11-23 11:52:48,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {7686#true} call #t~ret22 := main(); {7686#true} is VALID [2018-11-23 11:52:48,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {7686#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7688#(= main_~a~0 0)} is VALID [2018-11-23 11:52:48,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {7688#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7688#(= main_~a~0 0)} is VALID [2018-11-23 11:52:48,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {7688#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7689#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {7689#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7689#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {7689#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7690#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {7690#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7690#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {7690#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7691#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {7691#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7691#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {7691#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7692#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {7692#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7692#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {7692#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7693#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {7693#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7693#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {7693#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7694#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {7694#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7694#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {7694#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7695#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {7695#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7695#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {7695#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7696#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {7696#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7696#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {7696#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7697#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:48,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {7697#(<= main_~a~0 9)} assume !(~a~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {7687#false} havoc ~i~0;~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 29: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 31: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 33: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 34: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 43: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 44: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 45: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 46: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 48: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 49: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 51: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 55: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 57: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 58: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 59: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 60: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 61: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 62: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 63: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 64: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 65: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 66: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 67: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 68: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 69: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 70: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 71: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 72: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 73: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 74: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 76: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 77: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 78: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 79: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 80: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 81: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 82: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 83: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 84: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 85: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 86: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 87: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 88: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 89: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 90: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 91: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 92: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 93: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 94: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 95: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 96: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 97: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 98: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 99: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 100: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 101: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 102: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 103: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 104: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 105: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 106: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 107: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 108: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 109: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 110: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 111: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 112: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 113: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 114: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 115: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 116: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 117: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 118: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 119: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 120: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 121: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 122: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 123: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 124: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 125: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 126: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 127: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 128: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 129: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 130: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 131: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 132: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 133: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 134: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 135: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,367 INFO L273 TraceCheckUtils]: 136: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 137: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 138: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 139: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 140: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 141: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 142: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 143: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,368 INFO L273 TraceCheckUtils]: 144: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 145: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 146: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 147: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 148: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 149: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 150: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 151: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 152: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,369 INFO L273 TraceCheckUtils]: 153: Hoare triple {7687#false} havoc ~x~0;~x~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,370 INFO L273 TraceCheckUtils]: 154: Hoare triple {7687#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {7687#false} is VALID [2018-11-23 11:52:48,370 INFO L256 TraceCheckUtils]: 155: Hoare triple {7687#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {7687#false} is VALID [2018-11-23 11:52:48,370 INFO L273 TraceCheckUtils]: 156: Hoare triple {7687#false} ~cond := #in~cond; {7687#false} is VALID [2018-11-23 11:52:48,370 INFO L273 TraceCheckUtils]: 157: Hoare triple {7687#false} assume 0 == ~cond; {7687#false} is VALID [2018-11-23 11:52:48,370 INFO L273 TraceCheckUtils]: 158: Hoare triple {7687#false} assume !false; {7687#false} is VALID [2018-11-23 11:52:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:52:48,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:48,380 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-23 11:52:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:48,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:48,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:48,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {7686#true} call ULTIMATE.init(); {7686#true} is VALID [2018-11-23 11:52:48,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {7686#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7686#true} is VALID [2018-11-23 11:52:48,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {7686#true} assume true; {7686#true} is VALID [2018-11-23 11:52:48,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7686#true} {7686#true} #161#return; {7686#true} is VALID [2018-11-23 11:52:48,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {7686#true} call #t~ret22 := main(); {7686#true} is VALID [2018-11-23 11:52:48,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {7686#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7716#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:48,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {7716#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7716#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:48,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {7716#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7689#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {7689#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7689#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {7689#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7690#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {7690#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7690#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {7690#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7691#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {7691#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7691#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {7691#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7692#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {7692#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7692#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {7692#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7693#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {7693#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7693#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {7693#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7694#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {7694#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7694#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {7694#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7695#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {7695#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7695#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {7695#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7696#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {7696#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7696#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {7696#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7697#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {7697#(<= main_~a~0 9)} assume !(~a~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {7687#false} havoc ~i~0;~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,863 INFO L273 TraceCheckUtils]: 28: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,865 INFO L273 TraceCheckUtils]: 35: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,866 INFO L273 TraceCheckUtils]: 37: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7687#false} is VALID [2018-11-23 11:52:48,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {7687#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7687#false} is VALID [2018-11-23 11:52:48,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 41: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 43: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 46: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,867 INFO L273 TraceCheckUtils]: 47: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,868 INFO L273 TraceCheckUtils]: 48: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,868 INFO L273 TraceCheckUtils]: 49: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,868 INFO L273 TraceCheckUtils]: 51: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,868 INFO L273 TraceCheckUtils]: 52: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,868 INFO L273 TraceCheckUtils]: 53: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 55: Hoare triple {7687#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 57: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 58: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 59: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,869 INFO L273 TraceCheckUtils]: 60: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,870 INFO L273 TraceCheckUtils]: 61: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,870 INFO L273 TraceCheckUtils]: 62: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,870 INFO L273 TraceCheckUtils]: 63: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,870 INFO L273 TraceCheckUtils]: 64: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 67: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 68: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 69: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 70: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 71: Hoare triple {7687#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 72: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,871 INFO L273 TraceCheckUtils]: 73: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,872 INFO L273 TraceCheckUtils]: 74: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,872 INFO L273 TraceCheckUtils]: 75: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,872 INFO L273 TraceCheckUtils]: 76: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,872 INFO L273 TraceCheckUtils]: 77: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,872 INFO L273 TraceCheckUtils]: 78: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,872 INFO L273 TraceCheckUtils]: 79: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 80: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 81: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 82: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 83: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 84: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 85: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,873 INFO L273 TraceCheckUtils]: 86: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 87: Hoare triple {7687#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 88: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 89: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 90: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 91: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 92: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,874 INFO L273 TraceCheckUtils]: 93: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,875 INFO L273 TraceCheckUtils]: 94: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,875 INFO L273 TraceCheckUtils]: 95: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,875 INFO L273 TraceCheckUtils]: 96: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,875 INFO L273 TraceCheckUtils]: 97: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,875 INFO L273 TraceCheckUtils]: 98: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,875 INFO L273 TraceCheckUtils]: 99: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 100: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 101: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 102: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 103: Hoare triple {7687#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 104: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 105: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,876 INFO L273 TraceCheckUtils]: 106: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 107: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 108: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 109: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 110: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 111: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 112: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,877 INFO L273 TraceCheckUtils]: 113: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,878 INFO L273 TraceCheckUtils]: 114: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,878 INFO L273 TraceCheckUtils]: 115: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,878 INFO L273 TraceCheckUtils]: 116: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,878 INFO L273 TraceCheckUtils]: 117: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,878 INFO L273 TraceCheckUtils]: 118: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {7687#false} is VALID [2018-11-23 11:52:48,878 INFO L273 TraceCheckUtils]: 119: Hoare triple {7687#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 120: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 121: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 122: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 123: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 124: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 125: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,879 INFO L273 TraceCheckUtils]: 126: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 127: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 128: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 129: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 130: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 131: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 132: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,880 INFO L273 TraceCheckUtils]: 133: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,881 INFO L273 TraceCheckUtils]: 134: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {7687#false} is VALID [2018-11-23 11:52:48,881 INFO L273 TraceCheckUtils]: 135: Hoare triple {7687#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {7687#false} is VALID [2018-11-23 11:52:48,881 INFO L273 TraceCheckUtils]: 136: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,881 INFO L273 TraceCheckUtils]: 137: Hoare triple {7687#false} ~i~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,881 INFO L273 TraceCheckUtils]: 138: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,881 INFO L273 TraceCheckUtils]: 139: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 140: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 141: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 142: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 143: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 144: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 145: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,882 INFO L273 TraceCheckUtils]: 146: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,883 INFO L273 TraceCheckUtils]: 147: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,883 INFO L273 TraceCheckUtils]: 148: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,883 INFO L273 TraceCheckUtils]: 149: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,883 INFO L273 TraceCheckUtils]: 150: Hoare triple {7687#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {7687#false} is VALID [2018-11-23 11:52:48,883 INFO L273 TraceCheckUtils]: 151: Hoare triple {7687#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {7687#false} is VALID [2018-11-23 11:52:48,883 INFO L273 TraceCheckUtils]: 152: Hoare triple {7687#false} assume !(~i~0 < 100000); {7687#false} is VALID [2018-11-23 11:52:48,884 INFO L273 TraceCheckUtils]: 153: Hoare triple {7687#false} havoc ~x~0;~x~0 := 0; {7687#false} is VALID [2018-11-23 11:52:48,884 INFO L273 TraceCheckUtils]: 154: Hoare triple {7687#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {7687#false} is VALID [2018-11-23 11:52:48,884 INFO L256 TraceCheckUtils]: 155: Hoare triple {7687#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {7687#false} is VALID [2018-11-23 11:52:48,884 INFO L273 TraceCheckUtils]: 156: Hoare triple {7687#false} ~cond := #in~cond; {7687#false} is VALID [2018-11-23 11:52:48,884 INFO L273 TraceCheckUtils]: 157: Hoare triple {7687#false} assume 0 == ~cond; {7687#false} is VALID [2018-11-23 11:52:48,884 INFO L273 TraceCheckUtils]: 158: Hoare triple {7687#false} assume !false; {7687#false} is VALID [2018-11-23 11:52:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:52:48,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:48,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:52:48,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2018-11-23 11:52:48,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:48,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:49,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:49,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:49,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:49,011 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 13 states. [2018-11-23 11:52:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,656 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2018-11-23 11:52:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:52:49,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2018-11-23 11:52:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2018-11-23 11:52:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2018-11-23 11:52:49,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 116 transitions. [2018-11-23 11:52:50,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:50,139 INFO L225 Difference]: With dead ends: 306 [2018-11-23 11:52:50,139 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:52:50,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:52:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-11-23 11:52:50,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:50,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 166 states. [2018-11-23 11:52:50,320 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 166 states. [2018-11-23 11:52:50,321 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 166 states. [2018-11-23 11:52:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:50,325 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-11-23 11:52:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-11-23 11:52:50,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:50,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:50,326 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 167 states. [2018-11-23 11:52:50,326 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 167 states. [2018-11-23 11:52:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:50,330 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-11-23 11:52:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-11-23 11:52:50,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:50,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:50,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:50,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:52:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-11-23 11:52:50,335 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 159 [2018-11-23 11:52:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:50,336 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-11-23 11:52:50,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-11-23 11:52:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-23 11:52:50,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:50,338 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 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-23 11:52:50,338 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:50,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash 522251086, now seen corresponding path program 9 times [2018-11-23 11:52:50,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:50,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:50,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:51,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {9212#true} call ULTIMATE.init(); {9212#true} is VALID [2018-11-23 11:52:51,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {9212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9212#true} is VALID [2018-11-23 11:52:51,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {9212#true} assume true; {9212#true} is VALID [2018-11-23 11:52:51,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9212#true} {9212#true} #161#return; {9212#true} is VALID [2018-11-23 11:52:51,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {9212#true} call #t~ret22 := main(); {9212#true} is VALID [2018-11-23 11:52:51,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {9212#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9214#(= main_~a~0 0)} is VALID [2018-11-23 11:52:51,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {9214#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9214#(= main_~a~0 0)} is VALID [2018-11-23 11:52:51,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {9214#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9215#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:51,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {9215#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9215#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:51,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {9215#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9216#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:51,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {9216#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9216#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:51,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {9216#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9217#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:51,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {9217#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9217#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:51,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {9217#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9218#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:51,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {9218#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9218#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:51,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {9218#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9219#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:51,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {9219#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9219#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:51,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {9219#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9220#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:51,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {9220#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9220#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:51,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {9220#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9221#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:51,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {9221#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9221#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:51,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {9221#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9222#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:51,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {9222#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9222#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:51,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {9222#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9223#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:51,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {9223#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9223#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:51,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {9223#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9224#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:51,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {9224#(<= main_~a~0 10)} assume !(~a~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {9213#false} havoc ~i~0;~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,075 INFO L273 TraceCheckUtils]: 34: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,076 INFO L273 TraceCheckUtils]: 38: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,076 INFO L273 TraceCheckUtils]: 39: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9213#false} is VALID [2018-11-23 11:52:51,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {9213#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9213#false} is VALID [2018-11-23 11:52:51,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,078 INFO L273 TraceCheckUtils]: 48: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,078 INFO L273 TraceCheckUtils]: 49: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 50: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 51: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 52: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 53: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 54: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:52:51,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:52:51,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,080 INFO L273 TraceCheckUtils]: 59: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,080 INFO L273 TraceCheckUtils]: 60: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,080 INFO L273 TraceCheckUtils]: 61: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,081 INFO L273 TraceCheckUtils]: 66: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,081 INFO L273 TraceCheckUtils]: 67: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,082 INFO L273 TraceCheckUtils]: 68: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,082 INFO L273 TraceCheckUtils]: 71: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,082 INFO L273 TraceCheckUtils]: 72: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:52:51,082 INFO L273 TraceCheckUtils]: 73: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:52:51,083 INFO L273 TraceCheckUtils]: 74: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,083 INFO L273 TraceCheckUtils]: 75: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,083 INFO L273 TraceCheckUtils]: 76: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,083 INFO L273 TraceCheckUtils]: 77: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,083 INFO L273 TraceCheckUtils]: 78: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,083 INFO L273 TraceCheckUtils]: 79: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 80: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 82: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 83: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 84: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,084 INFO L273 TraceCheckUtils]: 86: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,085 INFO L273 TraceCheckUtils]: 88: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:52:51,085 INFO L273 TraceCheckUtils]: 89: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:52:51,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,085 INFO L273 TraceCheckUtils]: 91: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,085 INFO L273 TraceCheckUtils]: 92: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,086 INFO L273 TraceCheckUtils]: 93: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,086 INFO L273 TraceCheckUtils]: 96: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,086 INFO L273 TraceCheckUtils]: 97: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,086 INFO L273 TraceCheckUtils]: 98: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,087 INFO L273 TraceCheckUtils]: 99: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,087 INFO L273 TraceCheckUtils]: 100: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,087 INFO L273 TraceCheckUtils]: 101: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,087 INFO L273 TraceCheckUtils]: 102: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,087 INFO L273 TraceCheckUtils]: 103: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,087 INFO L273 TraceCheckUtils]: 104: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 105: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 106: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 107: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 108: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 109: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 110: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,088 INFO L273 TraceCheckUtils]: 111: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,089 INFO L273 TraceCheckUtils]: 112: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,089 INFO L273 TraceCheckUtils]: 113: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,089 INFO L273 TraceCheckUtils]: 114: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,089 INFO L273 TraceCheckUtils]: 115: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,089 INFO L273 TraceCheckUtils]: 116: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,089 INFO L273 TraceCheckUtils]: 117: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 118: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 119: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 120: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 121: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 122: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 123: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 124: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,090 INFO L273 TraceCheckUtils]: 125: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 126: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 127: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 128: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 129: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 130: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 131: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 132: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 133: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,091 INFO L273 TraceCheckUtils]: 134: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 135: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 136: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 137: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 138: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 139: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 140: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 141: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,092 INFO L273 TraceCheckUtils]: 142: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 143: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 144: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 145: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 146: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 147: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 148: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,093 INFO L273 TraceCheckUtils]: 149: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,094 INFO L273 TraceCheckUtils]: 150: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,094 INFO L273 TraceCheckUtils]: 151: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,094 INFO L273 TraceCheckUtils]: 152: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:52:51,094 INFO L273 TraceCheckUtils]: 153: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:52:51,094 INFO L273 TraceCheckUtils]: 154: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:52:51,095 INFO L273 TraceCheckUtils]: 155: Hoare triple {9213#false} havoc ~x~0;~x~0 := 0; {9213#false} is VALID [2018-11-23 11:52:51,095 INFO L273 TraceCheckUtils]: 156: Hoare triple {9213#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {9213#false} is VALID [2018-11-23 11:52:51,095 INFO L256 TraceCheckUtils]: 157: Hoare triple {9213#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {9213#false} is VALID [2018-11-23 11:52:51,095 INFO L273 TraceCheckUtils]: 158: Hoare triple {9213#false} ~cond := #in~cond; {9213#false} is VALID [2018-11-23 11:52:51,095 INFO L273 TraceCheckUtils]: 159: Hoare triple {9213#false} assume 0 == ~cond; {9213#false} is VALID [2018-11-23 11:52:51,095 INFO L273 TraceCheckUtils]: 160: Hoare triple {9213#false} assume !false; {9213#false} is VALID [2018-11-23 11:52:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 11:52:51,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:51,109 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-23 11:52:51,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:22,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:53:22,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:22,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:22,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {9212#true} call ULTIMATE.init(); {9212#true} is VALID [2018-11-23 11:53:22,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {9212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9212#true} is VALID [2018-11-23 11:53:22,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {9212#true} assume true; {9212#true} is VALID [2018-11-23 11:53:22,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9212#true} {9212#true} #161#return; {9212#true} is VALID [2018-11-23 11:53:22,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {9212#true} call #t~ret22 := main(); {9212#true} is VALID [2018-11-23 11:53:22,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {9212#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9212#true} is VALID [2018-11-23 11:53:22,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {9212#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9212#true} is VALID [2018-11-23 11:53:22,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {9212#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9212#true} is VALID [2018-11-23 11:53:22,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {9212#true} assume !(~a~0 < 100000); {9212#true} is VALID [2018-11-23 11:53:22,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {9212#true} havoc ~i~0;~i~0 := 0; {9309#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:22,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {9309#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9309#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:22,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {9309#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9316#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:22,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {9316#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9316#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:22,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {9316#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9323#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:22,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {9323#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9323#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:22,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {9323#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9330#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:22,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {9330#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9330#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:22,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {9330#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:22,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {9337#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:22,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {9337#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9344#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:22,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {9344#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9344#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:22,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {9344#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9351#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:22,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {9351#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9351#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:22,345 INFO L273 TraceCheckUtils]: 41: Hoare triple {9351#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9358#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:22,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {9358#(<= main_~i~0 7)} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,346 INFO L273 TraceCheckUtils]: 43: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,346 INFO L273 TraceCheckUtils]: 44: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,347 INFO L273 TraceCheckUtils]: 48: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,347 INFO L273 TraceCheckUtils]: 49: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,348 INFO L273 TraceCheckUtils]: 50: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,348 INFO L273 TraceCheckUtils]: 54: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 57: Hoare triple {9213#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 58: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 59: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 60: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,349 INFO L273 TraceCheckUtils]: 61: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 62: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 63: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 64: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 65: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 66: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 67: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 68: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 69: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,350 INFO L273 TraceCheckUtils]: 70: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 71: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 72: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 73: Hoare triple {9213#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 74: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 75: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 76: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 77: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 78: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,351 INFO L273 TraceCheckUtils]: 79: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 80: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 81: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 82: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 83: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 84: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 85: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 86: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 87: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 89: Hoare triple {9213#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 90: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 91: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 92: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 93: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 94: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 95: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,353 INFO L273 TraceCheckUtils]: 96: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 97: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 98: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 99: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 100: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 101: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 102: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 103: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 104: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {9213#false} is VALID [2018-11-23 11:53:22,354 INFO L273 TraceCheckUtils]: 105: Hoare triple {9213#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 106: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 107: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 108: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 109: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 110: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 111: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 112: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 113: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,355 INFO L273 TraceCheckUtils]: 114: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 115: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 116: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 117: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 118: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 119: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 120: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 121: Hoare triple {9213#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 122: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,356 INFO L273 TraceCheckUtils]: 123: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 124: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 125: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 126: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 127: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 128: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 129: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 130: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,357 INFO L273 TraceCheckUtils]: 131: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 132: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 133: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 134: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 135: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 136: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 137: Hoare triple {9213#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 138: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 139: Hoare triple {9213#false} ~i~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,358 INFO L273 TraceCheckUtils]: 140: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 141: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 142: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 143: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 144: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 145: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 146: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 147: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 148: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,359 INFO L273 TraceCheckUtils]: 149: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 150: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 151: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 152: Hoare triple {9213#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 153: Hoare triple {9213#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 154: Hoare triple {9213#false} assume !(~i~0 < 100000); {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 155: Hoare triple {9213#false} havoc ~x~0;~x~0 := 0; {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 156: Hoare triple {9213#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L256 TraceCheckUtils]: 157: Hoare triple {9213#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {9213#false} is VALID [2018-11-23 11:53:22,360 INFO L273 TraceCheckUtils]: 158: Hoare triple {9213#false} ~cond := #in~cond; {9213#false} is VALID [2018-11-23 11:53:22,361 INFO L273 TraceCheckUtils]: 159: Hoare triple {9213#false} assume 0 == ~cond; {9213#false} is VALID [2018-11-23 11:53:22,361 INFO L273 TraceCheckUtils]: 160: Hoare triple {9213#false} assume !false; {9213#false} is VALID [2018-11-23 11:53:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2018-11-23 11:53:22,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:22,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-11-23 11:53:22,398 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 161 [2018-11-23 11:53:22,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:22,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:53:22,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:22,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:53:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:53:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:53:22,481 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 21 states. [2018-11-23 11:53:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:24,305 INFO L93 Difference]: Finished difference Result 332 states and 358 transitions. [2018-11-23 11:53:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:53:24,305 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 161 [2018-11-23 11:53:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:53:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 254 transitions. [2018-11-23 11:53:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:53:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 254 transitions. [2018-11-23 11:53:24,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 254 transitions. [2018-11-23 11:53:25,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:25,039 INFO L225 Difference]: With dead ends: 332 [2018-11-23 11:53:25,039 INFO L226 Difference]: Without dead ends: 193 [2018-11-23 11:53:25,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:53:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-23 11:53:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2018-11-23 11:53:25,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:25,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 184 states. [2018-11-23 11:53:25,253 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 184 states. [2018-11-23 11:53:25,253 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 184 states. [2018-11-23 11:53:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:25,258 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 11:53:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 202 transitions. [2018-11-23 11:53:25,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:25,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:25,259 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 193 states. [2018-11-23 11:53:25,260 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 193 states. [2018-11-23 11:53:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:25,264 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 11:53:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 202 transitions. [2018-11-23 11:53:25,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:25,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:25,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:25,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 11:53:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-11-23 11:53:25,270 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 161 [2018-11-23 11:53:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:25,271 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-11-23 11:53:25,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:53:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-11-23 11:53:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-23 11:53:25,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:25,273 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 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-23 11:53:25,273 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:25,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -851919012, now seen corresponding path program 10 times [2018-11-23 11:53:25,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:25,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {10866#true} call ULTIMATE.init(); {10866#true} is VALID [2018-11-23 11:53:25,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {10866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10866#true} is VALID [2018-11-23 11:53:25,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {10866#true} assume true; {10866#true} is VALID [2018-11-23 11:53:25,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10866#true} {10866#true} #161#return; {10866#true} is VALID [2018-11-23 11:53:25,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {10866#true} call #t~ret22 := main(); {10866#true} is VALID [2018-11-23 11:53:25,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {10866#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10868#(= main_~a~0 0)} is VALID [2018-11-23 11:53:25,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {10868#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10868#(= main_~a~0 0)} is VALID [2018-11-23 11:53:25,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {10868#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10869#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:25,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {10869#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10869#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:25,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {10869#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10870#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:25,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {10870#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10870#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:25,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {10870#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10871#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:25,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {10871#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10871#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:25,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {10871#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10872#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:25,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {10872#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10872#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:25,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {10872#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10873#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:25,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {10873#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10873#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:25,910 INFO L273 TraceCheckUtils]: 17: Hoare triple {10873#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10874#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:25,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {10874#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10874#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:25,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {10874#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10875#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:25,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {10875#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10875#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:25,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {10875#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10876#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:25,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {10876#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10876#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:25,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {10876#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10877#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:25,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {10877#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10877#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:25,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {10877#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10878#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:25,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {10878#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10878#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:25,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {10878#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10879#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:25,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {10879#(<= main_~a~0 11)} assume !(~a~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {10867#false} havoc ~i~0;~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,919 INFO L273 TraceCheckUtils]: 42: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {10867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 48: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 49: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,920 INFO L273 TraceCheckUtils]: 50: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 52: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 53: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 54: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 56: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 57: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 58: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,921 INFO L273 TraceCheckUtils]: 59: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 60: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 61: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 62: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 63: Hoare triple {10867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 64: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 65: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 66: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 67: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,922 INFO L273 TraceCheckUtils]: 68: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 69: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 70: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 71: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 72: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 73: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 74: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 75: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,923 INFO L273 TraceCheckUtils]: 76: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 77: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 78: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 79: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 80: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 81: Hoare triple {10867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 82: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 83: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,924 INFO L273 TraceCheckUtils]: 84: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 85: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 86: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 87: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 88: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 89: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 90: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,925 INFO L273 TraceCheckUtils]: 91: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,926 INFO L273 TraceCheckUtils]: 92: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,926 INFO L273 TraceCheckUtils]: 93: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,926 INFO L273 TraceCheckUtils]: 95: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,926 INFO L273 TraceCheckUtils]: 96: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,926 INFO L273 TraceCheckUtils]: 97: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 98: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 99: Hoare triple {10867#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 100: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 101: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 102: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 103: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 104: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,927 INFO L273 TraceCheckUtils]: 105: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 106: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 107: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 108: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 109: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 110: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 111: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 112: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 113: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,928 INFO L273 TraceCheckUtils]: 114: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 115: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 116: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 117: Hoare triple {10867#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 118: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 119: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 120: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 121: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,929 INFO L273 TraceCheckUtils]: 122: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 123: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 124: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 125: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 126: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 127: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 128: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 129: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 130: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,930 INFO L273 TraceCheckUtils]: 131: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 132: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 133: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 134: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 135: Hoare triple {10867#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 136: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 137: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 138: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 139: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,931 INFO L273 TraceCheckUtils]: 140: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 141: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 142: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 143: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 144: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 145: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 146: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 147: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 148: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,932 INFO L273 TraceCheckUtils]: 149: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 150: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 151: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 152: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 153: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 154: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 155: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 156: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 157: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,933 INFO L273 TraceCheckUtils]: 158: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 159: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 160: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 161: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 162: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 163: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 164: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 165: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,934 INFO L273 TraceCheckUtils]: 166: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 167: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 168: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 169: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 170: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 171: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 172: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 173: Hoare triple {10867#false} havoc ~x~0;~x~0 := 0; {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L273 TraceCheckUtils]: 174: Hoare triple {10867#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {10867#false} is VALID [2018-11-23 11:53:25,935 INFO L256 TraceCheckUtils]: 175: Hoare triple {10867#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {10867#false} is VALID [2018-11-23 11:53:25,936 INFO L273 TraceCheckUtils]: 176: Hoare triple {10867#false} ~cond := #in~cond; {10867#false} is VALID [2018-11-23 11:53:25,936 INFO L273 TraceCheckUtils]: 177: Hoare triple {10867#false} assume 0 == ~cond; {10867#false} is VALID [2018-11-23 11:53:25,936 INFO L273 TraceCheckUtils]: 178: Hoare triple {10867#false} assume !false; {10867#false} is VALID [2018-11-23 11:53:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 11:53:25,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:25,948 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-23 11:53:25,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:26,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:26,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:26,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:26,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {10866#true} call ULTIMATE.init(); {10866#true} is VALID [2018-11-23 11:53:26,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {10866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10866#true} is VALID [2018-11-23 11:53:26,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {10866#true} assume true; {10866#true} is VALID [2018-11-23 11:53:26,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10866#true} {10866#true} #161#return; {10866#true} is VALID [2018-11-23 11:53:26,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {10866#true} call #t~ret22 := main(); {10866#true} is VALID [2018-11-23 11:53:26,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {10866#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10866#true} is VALID [2018-11-23 11:53:26,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {10866#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10866#true} is VALID [2018-11-23 11:53:26,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {10866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10866#true} is VALID [2018-11-23 11:53:26,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {10866#true} assume !(~a~0 < 100000); {10866#true} is VALID [2018-11-23 11:53:26,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {10866#true} havoc ~i~0;~i~0 := 0; {10866#true} is VALID [2018-11-23 11:53:26,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 38: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,442 INFO L273 TraceCheckUtils]: 40: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,443 INFO L273 TraceCheckUtils]: 41: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,443 INFO L273 TraceCheckUtils]: 42: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,443 INFO L273 TraceCheckUtils]: 43: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10866#true} is VALID [2018-11-23 11:53:26,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {10866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10866#true} is VALID [2018-11-23 11:53:26,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {10866#true} assume !(~i~0 < 100000); {10866#true} is VALID [2018-11-23 11:53:26,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {10866#true} ~i~0 := 0; {10866#true} is VALID [2018-11-23 11:53:26,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,444 INFO L273 TraceCheckUtils]: 49: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,444 INFO L273 TraceCheckUtils]: 50: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,444 INFO L273 TraceCheckUtils]: 51: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,444 INFO L273 TraceCheckUtils]: 52: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,445 INFO L273 TraceCheckUtils]: 53: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,445 INFO L273 TraceCheckUtils]: 54: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,445 INFO L273 TraceCheckUtils]: 55: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,445 INFO L273 TraceCheckUtils]: 56: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,445 INFO L273 TraceCheckUtils]: 57: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,445 INFO L273 TraceCheckUtils]: 58: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 59: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 60: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 61: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {10866#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 64: Hoare triple {10866#true} assume !(~i~0 < 100000); {10866#true} is VALID [2018-11-23 11:53:26,446 INFO L273 TraceCheckUtils]: 65: Hoare triple {10866#true} ~i~0 := 0; {10866#true} is VALID [2018-11-23 11:53:26,447 INFO L273 TraceCheckUtils]: 66: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,447 INFO L273 TraceCheckUtils]: 67: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,447 INFO L273 TraceCheckUtils]: 68: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,447 INFO L273 TraceCheckUtils]: 69: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,447 INFO L273 TraceCheckUtils]: 70: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,447 INFO L273 TraceCheckUtils]: 71: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,448 INFO L273 TraceCheckUtils]: 72: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,448 INFO L273 TraceCheckUtils]: 73: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,448 INFO L273 TraceCheckUtils]: 74: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,448 INFO L273 TraceCheckUtils]: 75: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,448 INFO L273 TraceCheckUtils]: 76: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,448 INFO L273 TraceCheckUtils]: 77: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,449 INFO L273 TraceCheckUtils]: 78: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,449 INFO L273 TraceCheckUtils]: 79: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,449 INFO L273 TraceCheckUtils]: 80: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10866#true} is VALID [2018-11-23 11:53:26,449 INFO L273 TraceCheckUtils]: 81: Hoare triple {10866#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10866#true} is VALID [2018-11-23 11:53:26,449 INFO L273 TraceCheckUtils]: 82: Hoare triple {10866#true} assume !(~i~0 < 100000); {10866#true} is VALID [2018-11-23 11:53:26,449 INFO L273 TraceCheckUtils]: 83: Hoare triple {10866#true} ~i~0 := 0; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 84: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 85: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 86: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 87: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 88: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 89: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,450 INFO L273 TraceCheckUtils]: 90: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,451 INFO L273 TraceCheckUtils]: 91: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,451 INFO L273 TraceCheckUtils]: 92: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,451 INFO L273 TraceCheckUtils]: 93: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,451 INFO L273 TraceCheckUtils]: 94: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,451 INFO L273 TraceCheckUtils]: 95: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,451 INFO L273 TraceCheckUtils]: 96: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,452 INFO L273 TraceCheckUtils]: 97: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,452 INFO L273 TraceCheckUtils]: 98: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {10866#true} is VALID [2018-11-23 11:53:26,452 INFO L273 TraceCheckUtils]: 99: Hoare triple {10866#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {10866#true} is VALID [2018-11-23 11:53:26,452 INFO L273 TraceCheckUtils]: 100: Hoare triple {10866#true} assume !(~i~0 < 100000); {10866#true} is VALID [2018-11-23 11:53:26,452 INFO L273 TraceCheckUtils]: 101: Hoare triple {10866#true} ~i~0 := 0; {10866#true} is VALID [2018-11-23 11:53:26,452 INFO L273 TraceCheckUtils]: 102: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 103: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 104: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 105: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 106: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 107: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 108: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,453 INFO L273 TraceCheckUtils]: 109: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,454 INFO L273 TraceCheckUtils]: 110: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,454 INFO L273 TraceCheckUtils]: 111: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,454 INFO L273 TraceCheckUtils]: 112: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,454 INFO L273 TraceCheckUtils]: 113: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,454 INFO L273 TraceCheckUtils]: 114: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,454 INFO L273 TraceCheckUtils]: 115: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,455 INFO L273 TraceCheckUtils]: 116: Hoare triple {10866#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {10866#true} is VALID [2018-11-23 11:53:26,455 INFO L273 TraceCheckUtils]: 117: Hoare triple {10866#true} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {10866#true} is VALID [2018-11-23 11:53:26,455 INFO L273 TraceCheckUtils]: 118: Hoare triple {10866#true} assume !(~i~0 < 100000); {10866#true} is VALID [2018-11-23 11:53:26,458 INFO L273 TraceCheckUtils]: 119: Hoare triple {10866#true} ~i~0 := 0; {11240#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:26,463 INFO L273 TraceCheckUtils]: 120: Hoare triple {11240#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11240#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:26,463 INFO L273 TraceCheckUtils]: 121: Hoare triple {11240#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11247#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:26,465 INFO L273 TraceCheckUtils]: 122: Hoare triple {11247#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11247#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:26,465 INFO L273 TraceCheckUtils]: 123: Hoare triple {11247#(<= main_~i~0 1)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11254#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:26,468 INFO L273 TraceCheckUtils]: 124: Hoare triple {11254#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11254#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:26,468 INFO L273 TraceCheckUtils]: 125: Hoare triple {11254#(<= main_~i~0 2)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11261#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:26,471 INFO L273 TraceCheckUtils]: 126: Hoare triple {11261#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11261#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:26,471 INFO L273 TraceCheckUtils]: 127: Hoare triple {11261#(<= main_~i~0 3)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11268#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:26,474 INFO L273 TraceCheckUtils]: 128: Hoare triple {11268#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11268#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:26,474 INFO L273 TraceCheckUtils]: 129: Hoare triple {11268#(<= main_~i~0 4)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11275#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:26,476 INFO L273 TraceCheckUtils]: 130: Hoare triple {11275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11275#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:26,476 INFO L273 TraceCheckUtils]: 131: Hoare triple {11275#(<= main_~i~0 5)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11282#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:26,476 INFO L273 TraceCheckUtils]: 132: Hoare triple {11282#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11282#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:26,477 INFO L273 TraceCheckUtils]: 133: Hoare triple {11282#(<= main_~i~0 6)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11289#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:26,477 INFO L273 TraceCheckUtils]: 134: Hoare triple {11289#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {11289#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:26,478 INFO L273 TraceCheckUtils]: 135: Hoare triple {11289#(<= main_~i~0 7)} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {11296#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:26,478 INFO L273 TraceCheckUtils]: 136: Hoare triple {11296#(<= main_~i~0 8)} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:26,478 INFO L273 TraceCheckUtils]: 137: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:26,478 INFO L273 TraceCheckUtils]: 138: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,478 INFO L273 TraceCheckUtils]: 139: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,478 INFO L273 TraceCheckUtils]: 140: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,479 INFO L273 TraceCheckUtils]: 141: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,479 INFO L273 TraceCheckUtils]: 142: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,479 INFO L273 TraceCheckUtils]: 143: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,479 INFO L273 TraceCheckUtils]: 144: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,479 INFO L273 TraceCheckUtils]: 145: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,479 INFO L273 TraceCheckUtils]: 146: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,480 INFO L273 TraceCheckUtils]: 147: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,480 INFO L273 TraceCheckUtils]: 148: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,480 INFO L273 TraceCheckUtils]: 149: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,480 INFO L273 TraceCheckUtils]: 150: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,480 INFO L273 TraceCheckUtils]: 151: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,481 INFO L273 TraceCheckUtils]: 152: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {10867#false} is VALID [2018-11-23 11:53:26,481 INFO L273 TraceCheckUtils]: 153: Hoare triple {10867#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {10867#false} is VALID [2018-11-23 11:53:26,481 INFO L273 TraceCheckUtils]: 154: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:26,481 INFO L273 TraceCheckUtils]: 155: Hoare triple {10867#false} ~i~0 := 0; {10867#false} is VALID [2018-11-23 11:53:26,481 INFO L273 TraceCheckUtils]: 156: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 157: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 158: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 159: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 160: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 161: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 162: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 163: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,482 INFO L273 TraceCheckUtils]: 164: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 165: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 166: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 167: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 168: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 169: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 170: Hoare triple {10867#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 171: Hoare triple {10867#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 172: Hoare triple {10867#false} assume !(~i~0 < 100000); {10867#false} is VALID [2018-11-23 11:53:26,483 INFO L273 TraceCheckUtils]: 173: Hoare triple {10867#false} havoc ~x~0;~x~0 := 0; {10867#false} is VALID [2018-11-23 11:53:26,484 INFO L273 TraceCheckUtils]: 174: Hoare triple {10867#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {10867#false} is VALID [2018-11-23 11:53:26,484 INFO L256 TraceCheckUtils]: 175: Hoare triple {10867#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {10867#false} is VALID [2018-11-23 11:53:26,484 INFO L273 TraceCheckUtils]: 176: Hoare triple {10867#false} ~cond := #in~cond; {10867#false} is VALID [2018-11-23 11:53:26,484 INFO L273 TraceCheckUtils]: 177: Hoare triple {10867#false} assume 0 == ~cond; {10867#false} is VALID [2018-11-23 11:53:26,484 INFO L273 TraceCheckUtils]: 178: Hoare triple {10867#false} assume !false; {10867#false} is VALID [2018-11-23 11:53:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-11-23 11:53:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-11-23 11:53:26,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2018-11-23 11:53:26,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:26,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:53:26,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:26,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:53:26,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:53:26,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:53:26,626 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 23 states. [2018-11-23 11:53:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:28,541 INFO L93 Difference]: Finished difference Result 366 states and 392 transitions. [2018-11-23 11:53:28,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:53:28,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2018-11-23 11:53:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:53:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 272 transitions. [2018-11-23 11:53:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:53:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 272 transitions. [2018-11-23 11:53:28,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 272 transitions. [2018-11-23 11:53:29,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:29,940 INFO L225 Difference]: With dead ends: 366 [2018-11-23 11:53:29,940 INFO L226 Difference]: Without dead ends: 211 [2018-11-23 11:53:29,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:53:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-23 11:53:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 202. [2018-11-23 11:53:30,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:30,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 202 states. [2018-11-23 11:53:30,438 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 202 states. [2018-11-23 11:53:30,438 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 202 states. [2018-11-23 11:53:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:30,443 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2018-11-23 11:53:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2018-11-23 11:53:30,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:30,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:30,444 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 211 states. [2018-11-23 11:53:30,445 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 211 states. [2018-11-23 11:53:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:30,450 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2018-11-23 11:53:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2018-11-23 11:53:30,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:30,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:30,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:30,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 11:53:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 211 transitions. [2018-11-23 11:53:30,456 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 211 transitions. Word has length 179 [2018-11-23 11:53:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:30,456 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 211 transitions. [2018-11-23 11:53:30,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:53:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 211 transitions. [2018-11-23 11:53:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-23 11:53:30,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:30,459 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 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-23 11:53:30,459 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:30,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1891986410, now seen corresponding path program 11 times [2018-11-23 11:53:30,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:30,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:31,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12690#true} is VALID [2018-11-23 11:53:31,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {12690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12690#true} is VALID [2018-11-23 11:53:31,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2018-11-23 11:53:31,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #161#return; {12690#true} is VALID [2018-11-23 11:53:31,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret22 := main(); {12690#true} is VALID [2018-11-23 11:53:31,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {12690#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12692#(= main_~a~0 0)} is VALID [2018-11-23 11:53:31,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {12692#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12692#(= main_~a~0 0)} is VALID [2018-11-23 11:53:31,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {12692#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:31,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {12693#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12693#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:31,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {12693#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12694#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:31,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {12694#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12694#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:31,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {12694#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12695#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:31,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {12695#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12695#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:31,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {12695#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12696#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:31,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {12696#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12696#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:31,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {12696#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12697#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:31,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {12697#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12697#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:31,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {12697#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12698#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:31,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {12698#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12698#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:31,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {12698#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12699#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:31,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {12699#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12699#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:31,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {12699#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12700#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:31,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {12700#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12700#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:31,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {12700#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12701#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:31,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {12701#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12701#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:31,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {12701#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12702#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:31,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {12702#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12702#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:31,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {12702#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12703#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:31,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {12703#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12703#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:31,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {12703#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12704#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:31,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {12704#(<= main_~a~0 12)} assume !(~a~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {12691#false} havoc ~i~0;~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,120 INFO L273 TraceCheckUtils]: 33: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,121 INFO L273 TraceCheckUtils]: 37: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,121 INFO L273 TraceCheckUtils]: 38: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,122 INFO L273 TraceCheckUtils]: 45: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {12691#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 51: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 62: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,124 INFO L273 TraceCheckUtils]: 63: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 64: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 65: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 66: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 67: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 68: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {12691#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 71: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,125 INFO L273 TraceCheckUtils]: 72: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 73: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 74: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 75: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 76: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 77: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 78: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 79: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 80: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,126 INFO L273 TraceCheckUtils]: 81: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 82: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 83: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 84: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 85: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 86: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 87: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 88: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 89: Hoare triple {12691#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 90: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,127 INFO L273 TraceCheckUtils]: 91: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 92: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 93: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 94: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 95: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 96: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 97: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 98: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 99: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,128 INFO L273 TraceCheckUtils]: 100: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 101: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 102: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 103: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 104: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 105: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 106: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 107: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 108: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 109: Hoare triple {12691#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12691#false} is VALID [2018-11-23 11:53:31,129 INFO L273 TraceCheckUtils]: 110: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 111: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 112: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 113: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 114: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 115: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 116: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 117: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 118: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 119: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,130 INFO L273 TraceCheckUtils]: 120: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 121: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 122: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 123: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 124: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 125: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 126: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 127: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 128: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 129: Hoare triple {12691#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {12691#false} is VALID [2018-11-23 11:53:31,131 INFO L273 TraceCheckUtils]: 130: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 131: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 132: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 133: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 134: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 135: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 136: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 137: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 138: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 139: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,132 INFO L273 TraceCheckUtils]: 140: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 141: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 142: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 143: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 144: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 145: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 146: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 147: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 148: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:53:31,133 INFO L273 TraceCheckUtils]: 149: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 150: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 151: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 152: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 153: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 154: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 155: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 156: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 157: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 158: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,134 INFO L273 TraceCheckUtils]: 159: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 160: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 161: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 162: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 163: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 164: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 165: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 166: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 167: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 168: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:53:31,135 INFO L273 TraceCheckUtils]: 169: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 170: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 171: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 172: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 173: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 174: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 175: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 176: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 177: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 178: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,136 INFO L273 TraceCheckUtils]: 179: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 180: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 181: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 182: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 183: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 184: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 185: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 186: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 187: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 188: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:53:31,137 INFO L273 TraceCheckUtils]: 189: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L273 TraceCheckUtils]: 190: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L273 TraceCheckUtils]: 191: Hoare triple {12691#false} havoc ~x~0;~x~0 := 0; {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L273 TraceCheckUtils]: 192: Hoare triple {12691#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L256 TraceCheckUtils]: 193: Hoare triple {12691#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L273 TraceCheckUtils]: 194: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L273 TraceCheckUtils]: 195: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2018-11-23 11:53:31,138 INFO L273 TraceCheckUtils]: 196: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2018-11-23 11:53:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-23 11:53:31,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:31,152 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-23 11:53:31,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:07,098 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 11:55:07,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:07,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12690#true} is VALID [2018-11-23 11:55:07,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {12690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12690#true} is VALID [2018-11-23 11:55:07,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2018-11-23 11:55:07,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #161#return; {12690#true} is VALID [2018-11-23 11:55:07,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret22 := main(); {12690#true} is VALID [2018-11-23 11:55:07,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {12690#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12690#true} is VALID [2018-11-23 11:55:07,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {12690#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {12690#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {12690#true} assume !(~a~0 < 100000); {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {12690#true} havoc ~i~0;~i~0 := 0; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 34: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,834 INFO L273 TraceCheckUtils]: 42: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 43: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 44: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 45: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 46: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 47: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 48: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 49: Hoare triple {12690#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12690#true} is VALID [2018-11-23 11:55:07,835 INFO L273 TraceCheckUtils]: 50: Hoare triple {12690#true} assume !(~i~0 < 100000); {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 51: Hoare triple {12690#true} ~i~0 := 0; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 52: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 53: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 57: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,836 INFO L273 TraceCheckUtils]: 58: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 59: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 60: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 61: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 62: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 63: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 64: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,837 INFO L273 TraceCheckUtils]: 65: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 66: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 67: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 68: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 69: Hoare triple {12690#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 70: Hoare triple {12690#true} assume !(~i~0 < 100000); {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 71: Hoare triple {12690#true} ~i~0 := 0; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 72: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 73: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,838 INFO L273 TraceCheckUtils]: 74: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 75: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 76: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 77: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 78: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 79: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 81: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 82: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,839 INFO L273 TraceCheckUtils]: 83: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 84: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 85: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 86: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 87: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 88: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 89: Hoare triple {12690#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 90: Hoare triple {12690#true} assume !(~i~0 < 100000); {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 91: Hoare triple {12690#true} ~i~0 := 0; {12690#true} is VALID [2018-11-23 11:55:07,840 INFO L273 TraceCheckUtils]: 92: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 93: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 94: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 95: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 96: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 97: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 98: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 99: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 100: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,841 INFO L273 TraceCheckUtils]: 101: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 102: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 103: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 104: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 105: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 106: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 107: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 108: Hoare triple {12690#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 109: Hoare triple {12690#true} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12690#true} is VALID [2018-11-23 11:55:07,842 INFO L273 TraceCheckUtils]: 110: Hoare triple {12690#true} assume !(~i~0 < 100000); {12690#true} is VALID [2018-11-23 11:55:07,843 INFO L273 TraceCheckUtils]: 111: Hoare triple {12690#true} ~i~0 := 0; {13041#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:07,843 INFO L273 TraceCheckUtils]: 112: Hoare triple {13041#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13041#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:07,844 INFO L273 TraceCheckUtils]: 113: Hoare triple {13041#(<= main_~i~0 0)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13048#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,844 INFO L273 TraceCheckUtils]: 114: Hoare triple {13048#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13048#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,844 INFO L273 TraceCheckUtils]: 115: Hoare triple {13048#(<= main_~i~0 1)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13055#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,845 INFO L273 TraceCheckUtils]: 116: Hoare triple {13055#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13055#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,845 INFO L273 TraceCheckUtils]: 117: Hoare triple {13055#(<= main_~i~0 2)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13062#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,846 INFO L273 TraceCheckUtils]: 118: Hoare triple {13062#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13062#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,846 INFO L273 TraceCheckUtils]: 119: Hoare triple {13062#(<= main_~i~0 3)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13069#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,847 INFO L273 TraceCheckUtils]: 120: Hoare triple {13069#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13069#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,848 INFO L273 TraceCheckUtils]: 121: Hoare triple {13069#(<= main_~i~0 4)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13076#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,848 INFO L273 TraceCheckUtils]: 122: Hoare triple {13076#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13076#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,849 INFO L273 TraceCheckUtils]: 123: Hoare triple {13076#(<= main_~i~0 5)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13083#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:07,849 INFO L273 TraceCheckUtils]: 124: Hoare triple {13083#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13083#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:07,850 INFO L273 TraceCheckUtils]: 125: Hoare triple {13083#(<= main_~i~0 6)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13090#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:07,851 INFO L273 TraceCheckUtils]: 126: Hoare triple {13090#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13090#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:07,851 INFO L273 TraceCheckUtils]: 127: Hoare triple {13090#(<= main_~i~0 7)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13097#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:07,852 INFO L273 TraceCheckUtils]: 128: Hoare triple {13097#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {13097#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:07,853 INFO L273 TraceCheckUtils]: 129: Hoare triple {13097#(<= main_~i~0 8)} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {13104#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:07,853 INFO L273 TraceCheckUtils]: 130: Hoare triple {13104#(<= main_~i~0 9)} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:55:07,854 INFO L273 TraceCheckUtils]: 131: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:55:07,854 INFO L273 TraceCheckUtils]: 132: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,854 INFO L273 TraceCheckUtils]: 133: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,855 INFO L273 TraceCheckUtils]: 134: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,855 INFO L273 TraceCheckUtils]: 135: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,855 INFO L273 TraceCheckUtils]: 136: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,855 INFO L273 TraceCheckUtils]: 137: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,856 INFO L273 TraceCheckUtils]: 138: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,856 INFO L273 TraceCheckUtils]: 139: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,856 INFO L273 TraceCheckUtils]: 140: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,856 INFO L273 TraceCheckUtils]: 141: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,857 INFO L273 TraceCheckUtils]: 142: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,857 INFO L273 TraceCheckUtils]: 143: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,857 INFO L273 TraceCheckUtils]: 144: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,858 INFO L273 TraceCheckUtils]: 145: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,858 INFO L273 TraceCheckUtils]: 146: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,858 INFO L273 TraceCheckUtils]: 147: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,858 INFO L273 TraceCheckUtils]: 148: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 149: Hoare triple {12691#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 150: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 151: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 152: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 153: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 154: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,859 INFO L273 TraceCheckUtils]: 155: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,860 INFO L273 TraceCheckUtils]: 156: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,860 INFO L273 TraceCheckUtils]: 157: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,860 INFO L273 TraceCheckUtils]: 158: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,860 INFO L273 TraceCheckUtils]: 159: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,860 INFO L273 TraceCheckUtils]: 160: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,860 INFO L273 TraceCheckUtils]: 161: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 162: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 163: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 164: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 165: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 166: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 167: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 168: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {12691#false} is VALID [2018-11-23 11:55:07,861 INFO L273 TraceCheckUtils]: 169: Hoare triple {12691#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 170: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 171: Hoare triple {12691#false} ~i~0 := 0; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 172: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 173: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 174: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 175: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 176: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 177: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,862 INFO L273 TraceCheckUtils]: 178: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 179: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 180: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 181: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 182: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 183: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 184: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 185: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 186: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,863 INFO L273 TraceCheckUtils]: 187: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 188: Hoare triple {12691#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 189: Hoare triple {12691#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 190: Hoare triple {12691#false} assume !(~i~0 < 100000); {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 191: Hoare triple {12691#false} havoc ~x~0;~x~0 := 0; {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 192: Hoare triple {12691#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L256 TraceCheckUtils]: 193: Hoare triple {12691#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 194: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 195: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2018-11-23 11:55:07,864 INFO L273 TraceCheckUtils]: 196: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2018-11-23 11:55:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2018-11-23 11:55:07,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:07,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-11-23 11:55:07,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 197 [2018-11-23 11:55:07,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:07,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:55:08,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:08,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:55:08,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:55:08,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:08,091 INFO L87 Difference]: Start difference. First operand 202 states and 211 transitions. Second operand 25 states. [2018-11-23 11:55:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:09,246 INFO L93 Difference]: Finished difference Result 400 states and 426 transitions. [2018-11-23 11:55:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:55:09,246 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 197 [2018-11-23 11:55:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 290 transitions. [2018-11-23 11:55:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 290 transitions. [2018-11-23 11:55:09,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 290 transitions. [2018-11-23 11:55:09,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:09,970 INFO L225 Difference]: With dead ends: 400 [2018-11-23 11:55:09,970 INFO L226 Difference]: Without dead ends: 229 [2018-11-23 11:55:09,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-23 11:55:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2018-11-23 11:55:10,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:10,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 220 states. [2018-11-23 11:55:10,309 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 220 states. [2018-11-23 11:55:10,310 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 220 states. [2018-11-23 11:55:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,316 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-11-23 11:55:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 238 transitions. [2018-11-23 11:55:10,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:10,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:10,317 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 229 states. [2018-11-23 11:55:10,317 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 229 states. [2018-11-23 11:55:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,323 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2018-11-23 11:55:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 238 transitions. [2018-11-23 11:55:10,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:10,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:10,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:10,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-23 11:55:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 229 transitions. [2018-11-23 11:55:10,329 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 229 transitions. Word has length 197 [2018-11-23 11:55:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:10,330 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 229 transitions. [2018-11-23 11:55:10,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:55:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 229 transitions. [2018-11-23 11:55:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-23 11:55:10,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:10,333 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:10,333 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:10,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1864249096, now seen corresponding path program 12 times [2018-11-23 11:55:10,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:10,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:10,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:10,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:10,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:11,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {14684#true} call ULTIMATE.init(); {14684#true} is VALID [2018-11-23 11:55:11,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {14684#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14684#true} is VALID [2018-11-23 11:55:11,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {14684#true} assume true; {14684#true} is VALID [2018-11-23 11:55:11,215 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14684#true} {14684#true} #161#return; {14684#true} is VALID [2018-11-23 11:55:11,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {14684#true} call #t~ret22 := main(); {14684#true} is VALID [2018-11-23 11:55:11,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {14684#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14686#(= main_~a~0 0)} is VALID [2018-11-23 11:55:11,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {14686#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14686#(= main_~a~0 0)} is VALID [2018-11-23 11:55:11,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {14686#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14687#(<= main_~a~0 1)} is VALID [2018-11-23 11:55:11,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {14687#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14687#(<= main_~a~0 1)} is VALID [2018-11-23 11:55:11,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {14687#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14688#(<= main_~a~0 2)} is VALID [2018-11-23 11:55:11,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {14688#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14688#(<= main_~a~0 2)} is VALID [2018-11-23 11:55:11,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {14688#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14689#(<= main_~a~0 3)} is VALID [2018-11-23 11:55:11,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {14689#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14689#(<= main_~a~0 3)} is VALID [2018-11-23 11:55:11,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {14689#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14690#(<= main_~a~0 4)} is VALID [2018-11-23 11:55:11,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {14690#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14690#(<= main_~a~0 4)} is VALID [2018-11-23 11:55:11,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {14690#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14691#(<= main_~a~0 5)} is VALID [2018-11-23 11:55:11,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {14691#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14691#(<= main_~a~0 5)} is VALID [2018-11-23 11:55:11,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {14691#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14692#(<= main_~a~0 6)} is VALID [2018-11-23 11:55:11,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {14692#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14692#(<= main_~a~0 6)} is VALID [2018-11-23 11:55:11,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {14692#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14693#(<= main_~a~0 7)} is VALID [2018-11-23 11:55:11,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {14693#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14693#(<= main_~a~0 7)} is VALID [2018-11-23 11:55:11,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {14693#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14694#(<= main_~a~0 8)} is VALID [2018-11-23 11:55:11,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {14694#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14694#(<= main_~a~0 8)} is VALID [2018-11-23 11:55:11,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {14694#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14695#(<= main_~a~0 9)} is VALID [2018-11-23 11:55:11,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {14695#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14695#(<= main_~a~0 9)} is VALID [2018-11-23 11:55:11,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {14695#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14696#(<= main_~a~0 10)} is VALID [2018-11-23 11:55:11,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {14696#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14696#(<= main_~a~0 10)} is VALID [2018-11-23 11:55:11,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {14696#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14697#(<= main_~a~0 11)} is VALID [2018-11-23 11:55:11,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {14697#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14697#(<= main_~a~0 11)} is VALID [2018-11-23 11:55:11,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {14697#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14698#(<= main_~a~0 12)} is VALID [2018-11-23 11:55:11,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {14698#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a8~0.base, ~#a8~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14698#(<= main_~a~0 12)} is VALID [2018-11-23 11:55:11,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {14698#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14699#(<= main_~a~0 13)} is VALID [2018-11-23 11:55:11,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {14699#(<= main_~a~0 13)} assume !(~a~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {14685#false} havoc ~i~0;~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,261 INFO L273 TraceCheckUtils]: 39: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,261 INFO L273 TraceCheckUtils]: 41: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 44: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 45: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 48: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 49: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 50: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 51: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 52: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 53: Hoare triple {14685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14685#false} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 54: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 55: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 57: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 58: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 59: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 60: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 61: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 62: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 63: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 64: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 65: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 66: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 67: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 68: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 69: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 72: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 73: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 74: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {14685#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 77: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 78: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 79: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 80: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 81: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 82: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 83: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 84: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 85: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 86: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 87: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 88: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,267 INFO L273 TraceCheckUtils]: 89: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 90: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 91: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 92: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 93: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 95: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,268 INFO L273 TraceCheckUtils]: 96: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {14685#false} is VALID [2018-11-23 11:55:11,269 INFO L273 TraceCheckUtils]: 97: Hoare triple {14685#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14685#false} is VALID [2018-11-23 11:55:11,269 INFO L273 TraceCheckUtils]: 98: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,269 INFO L273 TraceCheckUtils]: 99: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,269 INFO L273 TraceCheckUtils]: 100: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,269 INFO L273 TraceCheckUtils]: 101: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,269 INFO L273 TraceCheckUtils]: 102: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 103: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 104: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 105: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 106: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 107: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 108: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,270 INFO L273 TraceCheckUtils]: 109: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 110: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 111: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 112: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 113: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 114: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 115: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,271 INFO L273 TraceCheckUtils]: 116: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,272 INFO L273 TraceCheckUtils]: 117: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,272 INFO L273 TraceCheckUtils]: 118: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {14685#false} is VALID [2018-11-23 11:55:11,272 INFO L273 TraceCheckUtils]: 119: Hoare triple {14685#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {14685#false} is VALID [2018-11-23 11:55:11,272 INFO L273 TraceCheckUtils]: 120: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,272 INFO L273 TraceCheckUtils]: 121: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,272 INFO L273 TraceCheckUtils]: 122: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 123: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 124: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 126: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 127: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 128: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,273 INFO L273 TraceCheckUtils]: 129: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 130: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 131: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 132: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 133: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 134: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 135: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,274 INFO L273 TraceCheckUtils]: 136: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 137: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 138: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 139: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 140: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);havoc #t~mem12; {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 141: Hoare triple {14685#false} #t~post11 := ~i~0;~i~0 := 1 + #t~post11;havoc #t~post11; {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 142: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,275 INFO L273 TraceCheckUtils]: 143: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 144: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 145: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 146: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 147: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 148: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 149: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,276 INFO L273 TraceCheckUtils]: 150: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,277 INFO L273 TraceCheckUtils]: 151: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,277 INFO L273 TraceCheckUtils]: 152: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,277 INFO L273 TraceCheckUtils]: 153: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,277 INFO L273 TraceCheckUtils]: 154: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,277 INFO L273 TraceCheckUtils]: 155: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,277 INFO L273 TraceCheckUtils]: 156: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 157: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 158: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 159: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 160: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 161: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 162: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + 4 * ~i~0, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);havoc #t~mem14; {14685#false} is VALID [2018-11-23 11:55:11,278 INFO L273 TraceCheckUtils]: 163: Hoare triple {14685#false} #t~post13 := ~i~0;~i~0 := 1 + #t~post13;havoc #t~post13; {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 164: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 165: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 166: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 167: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 168: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 169: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,279 INFO L273 TraceCheckUtils]: 170: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,280 INFO L273 TraceCheckUtils]: 171: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,280 INFO L273 TraceCheckUtils]: 172: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,280 INFO L273 TraceCheckUtils]: 173: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,280 INFO L273 TraceCheckUtils]: 174: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,280 INFO L273 TraceCheckUtils]: 175: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,280 INFO L273 TraceCheckUtils]: 176: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 177: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 178: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 179: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 180: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 181: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 182: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,281 INFO L273 TraceCheckUtils]: 183: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 184: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + 4 * ~i~0, 4);call write~int(#t~mem16, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem16; {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 185: Hoare triple {14685#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 186: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 187: Hoare triple {14685#false} ~i~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 188: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 189: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,282 INFO L273 TraceCheckUtils]: 190: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 191: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 192: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 193: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 194: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 195: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 196: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,283 INFO L273 TraceCheckUtils]: 197: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 198: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 199: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 200: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 201: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 202: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 203: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,284 INFO L273 TraceCheckUtils]: 204: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L273 TraceCheckUtils]: 205: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L273 TraceCheckUtils]: 206: Hoare triple {14685#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + 4 * ~i~0, 4);call write~int(#t~mem18, ~#a9~0.base, ~#a9~0.offset + 4 * ~i~0, 4);havoc #t~mem18; {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L273 TraceCheckUtils]: 207: Hoare triple {14685#false} #t~post17 := ~i~0;~i~0 := 1 + #t~post17;havoc #t~post17; {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L273 TraceCheckUtils]: 208: Hoare triple {14685#false} assume !(~i~0 < 100000); {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L273 TraceCheckUtils]: 209: Hoare triple {14685#false} havoc ~x~0;~x~0 := 0; {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L273 TraceCheckUtils]: 210: Hoare triple {14685#false} assume !!(~x~0 < 100000);call #t~mem20 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem21 := read~int(~#a9~0.base, ~#a9~0.offset + 4 * ~x~0, 4); {14685#false} is VALID [2018-11-23 11:55:11,285 INFO L256 TraceCheckUtils]: 211: Hoare triple {14685#false} call __VERIFIER_assert((if #t~mem20 == #t~mem21 then 1 else 0)); {14685#false} is VALID [2018-11-23 11:55:11,286 INFO L273 TraceCheckUtils]: 212: Hoare triple {14685#false} ~cond := #in~cond; {14685#false} is VALID [2018-11-23 11:55:11,286 INFO L273 TraceCheckUtils]: 213: Hoare triple {14685#false} assume 0 == ~cond; {14685#false} is VALID [2018-11-23 11:55:11,286 INFO L273 TraceCheckUtils]: 214: Hoare triple {14685#false} assume !false; {14685#false} is VALID [2018-11-23 11:55:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-23 11:55:11,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:11,322 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-23 11:55:11,332 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE